Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Graph theory (Mathematics)"”.
-
On the minimum rank of certain graphs with path cover number 2
… an interesting and ongoing problem in spectral graph theory which seeks to answer the question "Given a simple graph G what is the minimum rank of a matrix whose off-diagonal zero/nonzero pattern is described by G?" In recent years, the minimum rank of trees, unicyclic graphs, and cases of …
-
Mode Vertices and Mode Graphs.
… of a vertex, <em>v</em>, of a connected graph, <em>G</em>, is the distance to a furthest vertex from <em>v</em>. A mode vertex of a connected graph, <em>G</em>, is a vertex whose eccentricity occurs as often in the eccentricity sequence of <em>G</em> as the eccentricity of any other …
-
Results on the Gold Grabbing Game
… this paper, we will contribute to research on a Graph Theory problem known as the Gold Grabbing Game. The game consists of two players and a tree in which each vertex has a positive integer value of gold. Players take turns removing leaves from the tree and deleting the associated edge until the …
-
The Four Color Theorem: A Possible New Approach
… goal of this thesis is to explore the topic of graph coloring and expand on existing ideas in the field of Graph Theory. These developments will then be used to provide a possible approach in proving the 4 – color theorem that was made famous by Guthrie in the 1800’s.</p> <p>Since the theorem …
-
Vertices in Total Dominating Sets.
… Laskar introduced the following concept. For a graph <em>G</em> = (<em>V</em>,<em>E</em>), let <em>rho</em> denote a property of interest concerning sets of vertices. A vertex <em>u</em> is <em>rho-good</em> if <em>u</em> is contained in a {minimum, maximum} <em>rho-set</em> in <em>G</em> and …