We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Maximal Dominating Cardinality in Hamiltonian Graph.
- Authors
vidhya, Subha; Tharaniya, P.; Jayalalitha, G.
- Abstract
The goal of this article provides the common formula for Minimal Domination Cardinality for all Hamiltonian Path or Hamiltonian Circuit. It is explained the way of structures and characteristics of General Hamiltonian Path or Hamiltonian Circuit. It invents the result that all the Hamiltonian Circuit from the given graph should be Cycle Graph. These derived formulae are common for all graphs those have Hamiltonian path or Hamiltonian Circuit. This formula is used to find Maximal Dominating Cardinality in a simple manner. Even though complicated graph also which has Hamiltonian Circuit is evaluating the Cardinality of Maximal Dominating Set is very easy way.
- Subjects
HAMILTONIAN graph theory; GRAPHIC methods; DOMINATING set; GRAPH theory; PARTITIONS (Mathematics)
- Publication
Journal of Algebraic Statistics, 2022, Vol 13, Issue 3, p1847
- ISSN
1309-3452
- Publication type
Article