Minimum 2-tuple dominating set of an interval graph

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

Sukumar Mondal, Tarasankar Pramanik, Madhumangal Pal

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 graphdominating set

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Tuple domination on graphs with the consecutive-zeros property ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum 2-tuple dominating set of an interval graph