Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Discrete Mathematics and Combinatorics
Extremal Theorems For Degree Sequence Packing And The Two-Color Discrete Tomography Problem, Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam, James Shook
Extremal Theorems For Degree Sequence Packing And The Two-Color Discrete Tomography Problem, Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam, James Shook
Faculty Publications
No abstract provided.
Packings And Coverings Of Complete Graphs With A Hole With The 4-Cycle With A Pendant Edge, Yan Xia
Packings And Coverings Of Complete Graphs With A Hole With The 4-Cycle With A Pendant Edge, Yan Xia
Electronic Theses and Dissertations
In this thesis, we consider packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and unrestricted coverings. Necessary and sufficient conditions are given for such structures for (1) complete graphs Kv, (2) complete bipartite graphs Km,n, and (3) complete graphs with a hole K(v,w).
Restricted And Unrestricted Coverings Of Complete Bipartite Graphs With Hexagons, Wesley M. Surber
Restricted And Unrestricted Coverings Of Complete Bipartite Graphs With Hexagons, Wesley M. Surber
Electronic Theses and Dissertations
A minimal covering of a graph G with isomorphic copies of graph H is a set {H1, H2, H3, ... , Hn} where Hi is isomorphic to H, the vertex set of Hi is a subset of G, the edge set of G is a subset of the union of Hi's, and the cardinality of the union of Hi's minus G is minimum. Some studies have been made of covering the complete graph in which case an added condition of the edge set of Hi …
Packings And Realizations Of Degree Sequences With Specified Substructures, Tyler Seacrest
Packings And Realizations Of Degree Sequences With Specified Substructures, Tyler Seacrest
Department of Mathematics: Dissertations, Theses, and Student Research
This dissertation focuses on the intersection of two classical and fundamental areas in graph theory: graph packing and degree sequences. The question of packing degree sequences lies naturally in this intersection, asking when degree sequences have edge-disjoint realizations on the same vertex set. The most significant result in this area is Kundu's k-Factor Theorem, which characterizes when a degree sequence packs with a constant sequence. We prove a series of results in this spirit, and we particularly search for realizations of degree sequences with edge-disjoint 1-factors.
Perhaps the most fundamental result in degree sequence theory is the Erdos-Gallai Theorem, characterizing …
Random Sequential Absorption On Graphs, Nicholas Pippenger
Random Sequential Absorption On Graphs, Nicholas Pippenger
All HMC Faculty Publications and Research
This paper analyzes a process whereby the vertices of a graph are considered in a random sequence,and each considered vertex is “occupied” unless it or an adjacent vertex has previously been occupied. The process continues until no more vertices can be occupied, at which point the “jamming limit” has been reached. The case in which the graph is regular (so that every vertex has degree $d\geqq 2$ and has “few short cycles” is treated. In particular, the results apply to infinite regular trees, to finite graphs obtained from them by forming quotient graphs, and to random regular graphs.
It is …