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: | |
|---|---|
| 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 |