Domination and total domination in complementary prisms

Teresa W. Haynes (), Michael A. Henning and Lucas C. Merwe
Additional contact information
Teresa W. Haynes: East Tennessee State University
Michael A. Henning: University of KwaZulu-Natal
Lucas C. Merwe: University of Tennessee at Chattanooga

Journal of Combinatorial Optimization, 2009, vol. 18, issue 1, No 2, 23-37

Abstract: Abstract Let G be a graph and ${\overline {G}}$ be the complement of G. The complementary prism $G{\overline {G}}$ of G is the graph formed from the disjoint union of G and ${\overline {G}}$ by adding the edges of a perfect matching between the corresponding vertices of G and ${\overline {G}}$ . For example, if G is a 5-cycle, then $G{\overline {G}}$ is the Petersen graph. In this paper we consider domination and total domination numbers of complementary prisms. For any graph G, $\max\{\gamma(G),\gamma({\overline {G}})\}\le \gamma(G{\overline {G}})$ and $\max\{\gamma_{t}(G),\gamma_{t}({\overline {G}})\}\le \gamma_{t}(G{\overline {G}})$ , where γ(G) and γ t (G) denote the domination and total domination numbers of G, respectively. Among other results, we characterize the graphs G attaining these lower bounds.

Keywords: Cartesian product; Complementary prism; Domination; Total domination (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9135-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:18:y:2009:i:1:d:10.1007_s10878-007-9135-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9135-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().