An extension of locating-total domination problem and its complexity

DOI10.1051/RO/2024123MaRDI QIDQ6652677zbMATH OpenFDO

Authors N. Eswar, R. Jayagopal

Publication date 13 December 2024

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2024123

zbMATH Keywords

\(r\)-locating-dominating set\(r\)-locating-total dominating setchain silicate graphcorona productscyclic silicate graphedge corona productsnecklace graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• A note on the complexity of locating-total domination in graphs
• Algorithmic results on locating-total domination in graphs
• A note on the locating-total domination in graphs
• Locating-total domination in graphs
• scientific article; zbMATH DE number 861343

Cites work

• R -Domination in Graphs
• 2-power domination number for Knödel graphs and its application in communication networks
• A new lower bound for the independent domination number of a tree
• A note on the double domination number in maximal outerplanar and planar graphs
• A note on the locating-total domination in graphs
• A polyhedral approach to locating-dominating sets in graphs
• Bounds on the locating-domination number and differentiating-total domination number in trees
• Bounds on the locating-total domination number of a tree
• Computation of topological indices of certain networks
• Connected domination critical graphs with a block having maximum number of cut vertices
• Dominated and dominator colorings over (edge) corona and hierarchical products
• Domination and location in acyclic graphs
• Embedding of hypercubes into necklace, windmill and snake graphs
• Fault-tolerant locating-dominating sets
• Generalization of the total outer-connected domination in graphs
• Graphs with unique minimum vertex-edge dominating sets
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2192146 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Identifying and locating-dominating codes on chains and cycles
• Independent domination, colorings and the fractional idomatic number of a graph
• Locating and total dominating sets in trees
• Locating domination in bipartite graphs and their complements
• Locating-dominating codes: bounds and extremal cardinalities
• Locating-dominating sets in hypergraphs
• Locating-dominating sets in twin-free graphs
• Locating-total domination critical graphs
• Locating-total domination in claw-free cubic graphs
• Locating-total domination in graphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Restrained {2}-domination in graphs
• Restrained double Roman domination of a graph
• Semitotal domination versus domination and total domination in trees
• The difference between the metric dimension and the determining number of a graph
• Total domination in graphs

This page was built for publication: An extension of locating-total domination problem and its complexity

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