The Numerical Invariants concerning the Total Domination for Generalized Petersen Graphs

Taiyin Zhao, Gohar Ali, Nabila Hameed, Syed Inayat Ali Shah, Yu-Ming Chu and Feng Feng

Journal of Mathematics, 2020, vol. 2020, 1-5

Abstract: A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to a vertex in S. The total domination number of a graph G denoted by γtG is the minimum cardinality of a total dominating set in G. The maximum order of a partition of VG into total dominating sets of G is called the total domatic number of G and is denoted by dtG. Domination in graphs has applications to several fields. Domination arises in facility location problems, where the number of facilities (e.g., hospitals and fire stations) is fixed, and one attempts to minimize the distance that a person needs to travel to get to the closest facility. In this paper, the numerical invariants concerning the total domination are studied for generalized Petersen graphs.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2020/5473675.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2020/5473675.xml (application/xml)

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:hin:jjmath:5473675

DOI: 10.1155/2020/5473675

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().