Document Type

Article

Publication Date

2010

Source Publication

Journal of Combinatorial Mathematics and Combinatorial Computing

Abstract

A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (dom (D)) whenever (u, z) ϵ A (D) or (v, z) ϵ A (D) for any other vertex z ϵ A (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UGc (D) is the union of two disjoint paths.

Comments

Published version. Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 72, No. 1 (2010). Used with permission.