Restricted and Unrestricted Coverings of Complete Bipartite Graphs with Hexagons
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 studie...
Main Author: | Surber, Wesley M |
---|---|
Format: | Others |
Published: |
Digital Commons @ East Tennessee State University
2013
|
Subjects: | |
Online Access: | https://dc.etsu.edu/etd/1136 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2315&context=etd |
Similar Items
-
Packings and Coverings of Various Complete Digraphs with the Orientations of a 4-Cycle.
by: Cooper, Melody Elaine
Published: (2007) -
Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc.
by: Lewenczuk, Janice Gail
Published: (2007) -
Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.
by: Cantrell, Daniel Shelton
Published: (2009) -
Packings and Coverings of Complete Graphs with a Hole with the 4-Cycle with a Pendant Edge
by: Xia, Yan
Published: (2013) -
Decompositions, Packings, and Coverings of Complete Directed Gaphs with a 3-Circuit and a Pendent Arc.
by: Gwellem, Chrys
Published: (2007)