Digraphs with Isomorphic Underlying and Domination Graphs: Pairs of Paths

Authors

Kim A. S. Factor, Marquette UniversityFollow
Larry J. Langley, University of the Pacific

Document Type

Article

Language

eng

Format of Original

28 p.

Publication Date

2010

Publisher

Charles Babbage Research Center

Source Publication

Journal of Combinatorial Mathematics and Combinatorial Computing

Source ISSN

0835-3026

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 UG^c (D) is the union of two disjoint paths.

Comments

Published version. Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 72, No. 1 (2010). DOI. © 2010 Charles Babbage Research Centre. Used with permission.

Recommended Citation

Factor, Kim A. S. and Langley, Larry J., "Digraphs with Isomorphic Underlying and Domination Graphs: Pairs of Paths" (2010). Mathematics, Statistics and Computer Science Faculty Research and Publications. 15.
https://epublications.marquette.edu/mscs_fac/15