Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
P_4-Decomposability In Regular Graphs And Multigraphs, David Joshua Mendell
P_4-Decomposability In Regular Graphs And Multigraphs, David Joshua Mendell
Theses and Dissertations
The main objective of this thesis is to review and expand the study of graph decomposability. An H-decomposition of a graph G=(V,E) is a partitioning of the edge set, $E$, into edge-disjoint isomorphic copies of a subgraph H. In particular we focus on the decompositions of graphs into paths. We prove that a 2,4 mutligraph with maximum multiplicity 2 admits a C_2,C_3-free Euler tour (and thus, a decomposition into paths of length 3 if it has size a multiple of 3) if and only if it avoids a set of 15 forbidden structures. We also prove that …
The Minimum Rank Of Schemes On Graphs, William Nelson Sexton
The Minimum Rank Of Schemes On Graphs, William Nelson Sexton
Theses and Dissertations
Let G be an undirected graph on n vertices and let S(G) be the class of all real-valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let V = {1, 2, . . . , n} be the vertex set of G. A scheme on G is a function f : V → {0, 1}. Given a scheme f on G, there is an associated class of matrices Sf (G) = {A ∈ S(G)|aii = 0 if and only if f(i) = 0}. A scheme f is said …