Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$
Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 51-67
Voir la notice de l'article provenant de la source Library of Science
The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) or (y,z) is an arc for every vertex z distinct from x and y. We consider directed graphs D for which the domination graph of D is isomorphic to the underlying graph of D. We demonstrate that the complement of the underlying graph must have k connected components isomorphic to complete graphs, paths, or cycles. A complete characterization of directed graphs where k = 1 is presented.
Keywords:
domination graph, domination, graph isomorphism, underlying graph
@article{DMGT_2007_27_1_a5,
author = {Factor, Kim and Langley, Larry},
title = {Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {51--67},
publisher = {mathdoc},
volume = {27},
number = {1},
year = {2007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a5/}
}
TY - JOUR AU - Factor, Kim AU - Langley, Larry TI - Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$ JO - Discussiones Mathematicae. Graph Theory PY - 2007 SP - 51 EP - 67 VL - 27 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a5/ LA - en ID - DMGT_2007_27_1_a5 ER -
Factor, Kim; Langley, Larry. Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$. Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 1, pp. 51-67. http://geodesic.mathdoc.fr/item/DMGT_2007_27_1_a5/