On the Embeddings of the Semi-Strong Product Graph
Over the years, a lot has been written about the three more common graph products (Cartesian product, Direct product and the Strong product), as all three of these are commutative products. This thesis investigates a non-commutative product graph, H, G, we call the Semi-Strong graph product, also re...
Main Author: | Brooks, Eric B |
---|---|
Format: | Others |
Published: |
VCU Scholars Compass
2015
|
Subjects: | |
Online Access: | http://scholarscompass.vcu.edu/etd/3811 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=4904&context=etd |
Similar Items
-
Domination Numbers of Semi-strong Products of Graphs
by: Cheney, Stephen R
Published: (2015) -
Graph embeddings and approximate graph coloring
by: Labelle, François.
Published: (2000) -
Uphill & Downhill Domination in Graphs and Related Graph Parameters.
by: Deering, Jessie
Published: (2013) -
Embeddings of Product Graphs Where One Factor is a Hypercube
by: Turner, Bethany
Published: (2011) -
Full embeddings and the category of graphs
by: Mendelsohn, Eric.
Published: (1968)