Secure total domination in chain graphs and cographs

DOI10.1016/j.akcej.2019.10.005zbMath1471.05083OpenAlexW3047884417MaRDI QIDQ4956172

Anupriya Jha

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.10.005

zbMATH Keywords

linear time algorithmchain graphscographstotal dominationsecure total domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Algorithmic results in secure total dominating sets on graphs ⋮ Secure connected domination and secure total domination in unit disk graphs and rectangle graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Bandwidth of chain graphs
• Complement reducible graphs
• On computing a minimum secure dominating set in block graphs
• The complexity of secure domination problem in graphs
• The secure domination problem in cographs
• Secure total domination in graphs: bounds and complexity
• Linear time solvable optimization problems on graphs of bounded clique-width
• Easy problems for tree-decomposable graphs
• Secure domination and secure total domination in graphs
• A Linear Recognition Algorithm for Cographs
• Node-Deletion Problems on Bipartite Graphs
• Algorithms and Computation

This page was built for publication: Secure total domination in chain graphs and cographs