Locating-Total Domination Number of Cacti Graphs
Joint Authors
Wei, Jianxin
Hameed, Saira
Ahmad, Uzma
Hanif, Javaria
Source
Mathematical Problems in Engineering
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-10-19
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
For a connected graph J, a subset W⊆VJ is termed as a locating-total dominating set if for a∈VJ, Na∩W≠ϕ, and for a, b∈VJ−W, Na∩W≠Nb∩W.
The number of elements in a smallest such subset is termed as the locating-total domination number of J.
In this paper, the locating-total domination number of unicyclic graphs and bicyclic graphs are studied and their bounds are presented.
Then, by using these bounds, an upper bound for cacti graphs in terms of their order and number of cycles is estimated.
Moreover, the exact values of this domination variant for some families of cacti graphs including tadpole graphs and rooted products are also determined.
American Psychological Association (APA)
Wei, Jianxin& Ahmad, Uzma& Hameed, Saira& Hanif, Javaria. 2020. Locating-Total Domination Number of Cacti Graphs. Mathematical Problems in Engineering،Vol. 2020, no. 2020, pp.1-10.
https://search.emarefa.net/detail/BIM-1196583
Modern Language Association (MLA)
Wei, Jianxin…[et al.]. Locating-Total Domination Number of Cacti Graphs. Mathematical Problems in Engineering No. 2020 (2020), pp.1-10.
https://search.emarefa.net/detail/BIM-1196583
American Medical Association (AMA)
Wei, Jianxin& Ahmad, Uzma& Hameed, Saira& Hanif, Javaria. Locating-Total Domination Number of Cacti Graphs. Mathematical Problems in Engineering. 2020. Vol. 2020, no. 2020, pp.1-10.
https://search.emarefa.net/detail/BIM-1196583
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1196583