Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 4 of 4
Full-Text Articles in Mathematics
Uniformly Connected Graphs, Nasreen Almohanna
Uniformly Connected Graphs, Nasreen Almohanna
Dissertations
Perhaps the most fundamental property that a graph can possess is that of being connected. Two vertices u and v of a graph G are connected if G contains a u-v path. The graph G itself is connected if every two vertices of G are connected. The well-studied concept of connectivity provides a measure on how strongly connected a graph may be. There are many other degrees of connectedness for a graph. A Hamiltonian path in a graph G is a path containing every vertex of G. Among the best-known classes of highly connected graph are the Hamiltonian-connected graphs, …
Graceful Colorings And Connection In Graphs, Alexis D. Byers
Graceful Colorings And Connection In Graphs, Alexis D. Byers
Dissertations
For a graph G of size m, a graceful labeling of G is an injective function f : V (G) → {0, 1, . . . , m} that gives rise to a bijective function f 1 : E(G) → {1, 2, . . . , m} defined by f 1(uv) = |f (u) − f (v)|. A graph is graceful if it has a graceful labeling. Over the years, a number of variations of graceful …
Edge Colorings Of Graphs And Their Applications, Daniel Johnston
Edge Colorings Of Graphs And Their Applications, Daniel Johnston
Dissertations
Edge colorings have appeared in a variety of contexts in graph theory. In this work, we study problems occurring in three separate settings of edge colorings.
For more than a quarter century, edge colorings have been studied that induce vertex colorings in some manner. One research topic we investigate concerns edge colorings belonging to this class of problems. By a twin edge coloring of a graph G is meant a proper edge coloring of G whose colors come from the integers modulo k that induce a proper vertex coloring in which the color of a vertex is the sum of …
On Eulerian Irregularity And Decompositions In Graphs, Eric Andrews
On Eulerian Irregularity And Decompositions In Graphs, Eric Andrews
Dissertations
Abstract attached as separate file.