2-domination number for special classes of hypercubes, enhanced hypercubes and Knödel graphs

S. Arulanand, R. Sundara Rajan and S. Prabhu

International Journal of Networking and Virtual Organisations, 2023, vol. 29, issue 2, 168-182

Abstract: The system is fault-tolerant if, in the case that just one of the previously employed units fails, a different chain of units is utilised in its place. Because they provide the best fault tolerance, cycle-related graphs are employed in network analysis, periodic scheduling, and surface reconstruction. This can be achieved through a mathematical concept called domination. In a graph, each node has a minimum of one neighbour in a set, and then the set is called a dominating set of a network. A dominating set with the least cardinality is the domination number of the network. In this paper, we obtain the 2-domination number of some special classes of hypercubes, enhanced hypercubes, and Knödel graphs proving that the lower bound obtained in Fink and Jacobson (1985). quite precise, and also we prove that the time complexity of the 2-domination problem for the above graphs are linear.

Keywords: domination; 2-domination; hypercube; enhanced hypercube; Knödel graph; optimisation; time complexity. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=134993 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijnvor:v:29:y:2023:i:2:p:168-182

Access Statistics for this article

More articles in International Journal of Networking and Virtual Organisations from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().