Year: 2010
Type: article
Abstract: A domination graph of a digraph D, dom(D), is created using the vertex set of D, V(D). There is an edge uv in dom(D) whenever (u, z) or (v, z) is in the arc set of D, A(D), for every other vertex z ε V(D). For only some digraphs D has the structure of dom(D) been characterized. Examples of this are tournaments and regular digraphs. The authors have characterizations for the structure of digraphs D for which UG(D) = dom(D) or UG(D) ≅ dom(D). For example, when UG(D) ≅ dom(D), the only components of the complement of UG(D) are complete graphs, paths and cycles. Here, we determine values of i and j for which UG(D) ≅ dom(D) and UGC(D) = C4 υ Pi υ Pj.
Authors: Kim A. S. Factor, Larry J. Langley
Institutions: Marquette University, University of the Pacific
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W66876153