On Domatic Number of Some Rotationally Symmetric Graphs

Hassan Raza, Sunny Kumar Sharma, Muhammad Azeem and Gaetano Luciano

Journal of Mathematics, 2023, vol. 2023, 1-11

Abstract: Domination is a well-known graph theoretic concept due to its significant real-world applications in several domains, such as design and communication network analysis, coding theory, and optimization. For a connected graph Γ=V,E, a subset U of VΓ is called a dominating set if every member present in V−U is adjacent to at least one member in U. The domatic partition is the partition of the vertices VΓ into the disjoint dominating set. The domatic number of the graph Γ is the maximum cardinality of the disjoint dominating sets. In this paper, we improved the results for the middle and central graphs of a cycle, respectively. Furthermore, we discuss the domatic number for some other cycle-related graphs and graphs of convex polytopes.

Date: 2023
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2023/3816772.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2023/3816772.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:3816772

DOI: 10.1155/2023/3816772

Access Statistics for this article

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