Exploration of the Possible Benifits for the Complementary Perfect Matching Models with Applications

G. Mahadevan, M. Vimala Suganthi and Selvam Avadayappan
Additional contact information
G. Mahadevan: Gandhigram Rural Institute-Deemed to be University, Department of Mathematics
M. Vimala Suganthi: Gandhigram Rural Institute-Deemed to be University, Department of Mathematics
Selvam Avadayappan: V.H.N.S.N. College, Department of Mathematics

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

Abstract: Abstract A set S ⊆ V of a graph G is said to be restrained step dominating set, if is the restrained dominating set and is a perfect matching. The minimum cardinality taken over all the restrained step dominating set is called the restrained step dominating number of G and is denoted by γrsd(G). In this paper we have discussed its application and extend the study of this parameter for Cartesian product of graphs.

Keywords: Complementary perfect domination number; Restrained domination number; Restrained step domination number; 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_108

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

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

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 ().