Interrogation for Modernistic Conceptualization of Complementary Perfect Hop Domination Number with Various Grid Models

G. Mahadevan, V. Vijayalakshmi and Selvam Aavadayappan
Additional contact information
G. Mahadevan: Gandhigram Rural Institute—Deemed to be University, Department of Mathematics
V. Vijayalakshmi: Gandhigram Rural Institute—Deemed to be University, Department of Mathematics
Selvam Aavadayappan: VHNSN College, Department of Mathematics

A chapter in New Trends in Computational Vision and Bio-inspired Computing, 2020, pp 1219-1227 from Springer

Abstract: Abstract In this paper, we introduce the concept of Complementary perfect hop domination number of a graph. A set S ⊆ V is a hop dominating set of G, if every vertex v ∈ V − S there exists u ∈ S such that d(u,v) = 2. A set S ⊆ V is a complementary perfect hop dominating set of G if S is a hop dominating set and has atleast one perfect matching. The minimum cardinality of complementary perfect hop dominating set is called complementary perfect hop domination number of G and it is denoted by CPHD(G). Here, we investigate this CPHD number for some mirror graphs and some special type of graphs.

Keywords: 05C69 (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-3-030-41862-5_123

Ordering information: This item can be ordered from
http://www.springer.com/9783030418625

DOI: 10.1007/978-3-030-41862-5_123

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().