Domination Graphs with Nontrivial Components

2001 ◽  
Vol 17 (2) ◽  
pp. 227-236 ◽  
Author(s):  
David C. Fisher ◽  
David Guichard ◽  
J. Richard Lundgren ◽  
Sarah K. Merz ◽  
K. Brooks Reid
Keyword(s):  
Domination Graphs

scholarly journals Planar Characterization – Graph Domination Graphs

2018 ◽  
Vol 7 (4.10) ◽  
pp. 949
Author(s):  
A. Elakkiya ◽  
M. Yamuna
Keyword(s):  
Graph Domination ◽  
Matlab Program ◽  
Domination Graphs

In this paper, we characterize planarity and outer planarity of complement of graph domination graphs and provide a MATLAB program for identifying graph domination graphs.  

scholarly journals Kings and Heirs: A characterization of the (2,2)-domination graphs of tournaments

2016 ◽  
Vol 204 ◽  
pp. 142-149
Author(s):  
Kim A.S. Factor ◽  
Larry J. Langley
Keyword(s):  
Domination Graphs

scholarly journals Domination graphs of regular tournaments

2002 ◽  
Vol 252 (1-3) ◽  
pp. 57-71 ◽  
Author(s):  
Han Hyuk Cho ◽  
Suh-Ryung Kim ◽  
J.Richard Lundgren
Keyword(s):  
Domination Graphs

Some results on the exact 1-step domination graphs

2019 ◽  
Vol 44 ◽  
pp. 15-27
Author(s):  
Marzieh Farhadi Jalalvand ◽  
◽  
Nader Jafari Rad ◽  
Maryam Ghorani ◽  
◽  
...  
Keyword(s):  
Domination Graphs

Digraphs with underlying and domination graphs: Connected UGc(D)

2007 ◽  
Vol 27 (1) ◽  
pp. 51
Author(s):  
Kim A.S. Factor ◽  
Larry J. Langley
Keyword(s):  
Domination Graphs

scholarly journals Graphs that are simultaneously efficient open domination and efficient closed domination graphs

2017 ◽  
Vol 217 ◽  
pp. 613-621 ◽  
Author(s):  
Sandi Klavžar ◽  
Iztok Peterin ◽  
Ismael G. Yero
Keyword(s):  
Domination Graphs

scholarly journals Efficient open domination in graph products

2014 ◽  
Vol Vol. 16 no. 1 (Graph Theory) ◽  
Author(s):  
Dorota Kuziak ◽  
Iztok Peterin ◽  
Ismael Gonzalez Yero
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Graph Products ◽  
International Audience ◽  
Domination Graphs

Graph Theory International audience A graph G is an efficient open domination graph if there exists a subset D of V(G) for which the open neighborhoods centered in vertices of D form a partition of V(G). We completely describe efficient open domination graphs among lexicographic, strong, and disjunctive products of graphs. For the Cartesian product we give a characterization when one factor is K2.

On domination elimination orderings and domination graphs

1995 ◽  
pp. 81-92 ◽  
Author(s):  
Elias Dahihaus ◽  
Peter Hammer ◽  
Frédéric Maffray ◽  
Stephan Olariu
Keyword(s):  
Domination Graphs

scholarly journals Planar domination graphs

2003 ◽  
Vol 268 (1-3) ◽  
pp. 129-137
Author(s):  
Elaine M. Eschen ◽  
William F. Klostermeyer ◽  
R. Sritharan
Keyword(s):  
Domination Graphs
Sign in / Sign up

Export Citation Format

Share Document