Algorithmic aspects of open neighborhood location-domination in graphs

DOI10.1016/J.DAM.2015.03.002MaRDI QIDQ344871zbMATH OpenOpenAlexFDO

Authors B. S. Panda, Arti Pandey

Publication date 24 November 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.03.002

zbMATH Keywords

approximation algorithmgraph algorithmdominationNP-completechordal graphAPX-complete

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Recommendations

• On open neighborhood locating-dominating in graphs
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• Open neighborhood locating-dominating in trees
• scientific article; zbMATH DE number 5717189
• Algorithmic results on locating-total domination in graphs

Cites work

• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (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 1142299 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• Dually Chordal Graphs
• Graph theory
• Incidence matrices and interval graphs
• Introduction to algorithms
• Open neighborhood locating-dominating in trees
• Reducibility among combinatorial problems
• Some APX-completeness results for cubic graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(11)

• On open-separating dominating codes in graphs
• The adjacency dimension of graphs
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
• On open neighborhood locating-dominating in graphs
• Characterizing extremal graphs for open neighbourhood location-domination
• Linear-time algorithms for three domination-based separation problems in block graphs
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• Extremal Digraphs for open neighbourhood location-domination and identifying codes
• OLD trees with maximum degree three
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs

This page was built for publication: Algorithmic aspects of open neighborhood location-domination in graphs

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