Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Graph theory (5)
- Almost intersecting set families (1)
- Chromatic (1)
- Color-induced (1)
- Combinatorics (1)
-
- Connectivity (1)
- Cycle rank (1)
- Domination (1)
- Dutch windmill (1)
- Edge coloring (1)
- Erdős-Ko-Rado theorem (1)
- Extremal graphs (1)
- Four color theorem (1)
- Graph coloring (1)
- Graph labeling (1)
- Harmonious labelings (1)
- Irregular domination (1)
- Labelings (1)
- Mean coloring (1)
- Multi-prime labelings (1)
- Proper coloring (1)
- Proper path coloring (1)
- Royal coloring (1)
- Zonality (1)
- Publication
Articles 1 - 9 of 9
Full-Text Articles in Discrete Mathematics and Combinatorics
Irregular Domination In Graphs, Caryn Mays
Irregular Domination In Graphs, Caryn Mays
Dissertations
Domination in graphs has been a popular area of study due in large degree to its applications to modern society as well as the mathematical beauty of the topic. While this area evidently began with the work of Claude Berge in 1958 and Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of a survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then, a large number of variations of domination have surfaced and provided numerous applications to different areas of science and real-life problems. Among these variations are domination parameters …
Zonality In Graphs, Andrew Bowling
Zonality In Graphs, Andrew Bowling
Dissertations
Graph labeling and coloring are among the most popular areas of graph theory due to both the mathematical beauty of these subjects as well as their fascinating applications. While the topic of labeling vertices and edges of graphs has existed for over a century, it was not until 1966 when Alexander Rosa introduced a labeling, later called a graceful labeling, that brought the area of graph labeling to the forefront in graph theory. The subject of graph colorings, on the other hand, goes back to 1852 when the young British mathematician Francis Guthrie observed that the countries in a map …
From Multi-Prime To Subset Labelings Of Graphs, Bethel I. Mcgrew
From Multi-Prime To Subset Labelings Of Graphs, Bethel I. Mcgrew
Dissertations
A graph labeling is an assignment of labels (elements of some set) to the vertices or edges (or both) of a graph G. If only the vertices of G are labeled, then the resulting graph is a vertex-labeled graph. If only the edges are labeled, the resulting graph is an edge-labeled graph. The concept was first introduced in the 19th century when Arthur Cayley established Cayley’s Tree Formula, which proved that there are nn-2 distinct labeled trees of order n. Since then, it has grown into a popular research area.
In this study, we first review several types …
Extremal Problems On Induced Graph Colorings, James Hallas
Extremal Problems On Induced Graph Colorings, James Hallas
Dissertations
Graph coloring is one of the most popular areas of graph theory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. As far back as 1880, in an attempt to solve the famous Four Color Problem, there have been numerous examples of certain types of graph colorings that have generated other graph colorings of interest. These types of colorings only gained momentum a century later, however, when in the 1980s, edge colorings were studied that led to vertex colorings of various types, led by the introduction …
Chromatic Connectivity Of Graphs, Elliot Laforge
Average Genus Of The Cube, Jody Koenemann
Average Genus Of The Cube, Jody Koenemann
Honors Theses
In recent years, there has been interest in the mathematical community in a rapidly developing branch of theoretical mathematics known as random topological graph theory. This new area of mathematics explores the different ways in which certain graphs can be imbedded in given surfaces. The random nature of the new branch results when one also imposes a random distribution on set of all imbeddings of a fixed graph, via the orientation of the edges at each vertex. Using the technique of J. Edmonds, developed in 1960, this paper explores the imbeddings for the graph Q3 using a particular group …
Third Order Degree Regular Graphs, Leslie D. Hayes
Third Order Degree Regular Graphs, Leslie D. Hayes
Honors Theses
A graph G is regular of degree d if for every vertex v in G there exist exactly d vertices at distance 1 from v. A graph G is kth order regular of degree d if for every vertex v in G, there exist exactly d vertices at distance k from v. In this paper, third order regular graphs of degree 1 with small order are characterized.
Generalized Distance In Graphs, Garry L. Johns
Imbedding Problems In Graph Theory, William Goodwin
Imbedding Problems In Graph Theory, William Goodwin
Honors Theses
For some years there has been interest among mathematicians in determining the different ways in which certain graphs can be imbedded in given surfaces. M.P. VanStraten in 1948, determined that it is possible to imbed the graph K3,3 (which is the graph representing the famous three houses, three utilities problem) in the torus in only two ways. She then used this fact to show that the graph representing the configuration of Desargues (containing K3,3 as a subgraph) has genus two. One major source of motivation for the work on imbedding problems has been their relation to coloring problems …