Convex and isometric domination of (weak) dominating pair graphs

DOI10.1016/j.tcs.2018.03.023zbMath1391.05195arXiv1704.08484OpenAlexW2962760029MaRDI QIDQ1749540

Boštjan Brešar, Tanja Gologranc, Tim Kos

Publication date: 17 May 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.08484

zbMATH Keywords

convex hullconvex dominationdominating pair graphisometric domination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inapproximability results for graph convexity parameters
• A note on the weakly convex and convex domination numbers of a torus
• Tree loop graphs
• The maximum infection time in the geodesic and monophonic convexities
• Interval graphs and maps of DNA
• Hereditary dominating pair graphs
• Nordhaus-Gaddum results for the convex domination number of a graph
• On the geodetic hull number of \(P_{k}\)-free graphs
• Nordhaus-Gaddum results for weakly convex domination number of a graph
• Representation of a finite graph by a set of intervals on the real line
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Asteroidal Triple-Free Graphs
• Dominating Pair Graphs
• Convex domination in the composition and cartesian product of graphs
• Reducibility among Combinatorial Problems
• Computing a dominating pair in an asteroidal triple-free graph in linear time

This page was built for publication: Convex and isometric domination of (weak) dominating pair graphs