Locating-total domination number of cacti graphs

DOI10.1155/2020/6197065MaRDI QIDQ2209668zbMATH OpenOpenAlexFDO

Authors Jianxin Wei, Uzma Ahmad, Saira Hameed, Javaria Hanif

Publication date 4 November 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/6197065

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

Summary: For a connected graph \(J\), a subset \(W\subseteq V\left( J\right)\) is termed as a locating-total dominating set if for \(a\in V\left( J\right),N\left( a\right)\cap W\neq\phi \), and for \(a,b\in V\left( J\right)-W,N\left( a\right)\cap W\neq N\left( b\right)\cap 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.

Recommendations

• Locating and differentiating-total dominating sets in unicyclic graphs.
• Locating-total domination in graphs
• A classification of cactus graphs according to their total domination number
• Bounds on locating-total domination number of the Cartesian product of cycles.
• Locating-total domination in claw-free cubic graphs

Cites work

• Bounding the locating-total domination number of a tree in terms of its annihilation number
• Bounds on locating total domination number of the Cartesian product of cycles and paths
• Bounds on the locating-total domination number of a tree
• Locating and paired-dominating sets in graphs
• Locating and total dominating sets in trees
• Locating-total domination critical graphs
• Locating-total domination in claw-free cubic graphs

Cited in

(3)

• Locating and differentiating-total dominating sets in unicyclic graphs.
• Bounds on locating total domination number of the Cartesian product of cycles and paths
• Bounds on locating-total domination number of the Cartesian product of cycles.

This page was built for publication: Locating-total domination number of cacti graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2209668)