Cancellation Properties of Direct Products of Digraphs
This paper discusses the direct product cancellation of digraphs. We define the exact conditions on G such that GxK=HxK implies G=H. We focus first on simple equations such as GxK_2=HxK_2 where K_2 denotes a single arc and then extend this to the more general situation, GxK = HxK. Our results are ac...
Main Author: | Toman, Katherine |
---|---|
Format: | Others |
Published: |
VCU Scholars Compass
2009
|
Subjects: | |
Online Access: | http://scholarscompass.vcu.edu/etd/1776 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=2775&context=etd |
Similar Items
-
A Lexicographic Product Cancellation Property for Digraphs
by: Manion, Kendall
Published: (2012) -
Characterizing Cancellation Graphs
by: Mullican, Cristina
Published: (2014) -
Kings in the Direct Product of Digraphs
by: Norge, Morgan
Published: (2019) -
Efficient Open Domination in Digraph Products
by: Dragana Božović, et al.
Published: (2020-04-01) -
On chordal digraphs and semi-strict chordal digraphs
by: Ye, Ying Ying
Published: (2019)