Minimum 2-tuple dominating set of an interval graph

DOI10.1155/2011/389369zbMath1236.05155WikidataQ58655889 ScholiaQ58655889MaRDI QIDQ666518

Madhumangal Pal, Tarasankar Pramanik, Sukumar Mondal

Publication date: 8 March 2012

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

Full work available at URL: https://doi.org/10.1155/2011/389369

zbMATH Keywords

intersection graph; dominating set

Mathematics Subject Classification ID

05C12: Distance in graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Minimum 2-tuple dominating set of permutation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to domination problems on interval graphs
• Nordhaus-Gaddum inequalities for domination in graphs
• Hamiltonian properties of domination-critical graphs
• Vertex domination-critical graphs
• Total domination in graphs
• An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
• Total Domination Edge Critical Graphs with Maximum Diameter
• Vertex domination‐critical graphs
• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
• THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
• Domination critical graphs