Dominating Pair Graphs

DOI10.1137/S0895480100367111MaRDI QIDQ4785689zbMATH OpenOpenAlexFDO

Authors Jitender Deogun, Dieter Kratsch

Publication date 5 January 2003

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480100367111

zbMATH Keywords

algorithmsgraph classesasteroidal triple-free graphsdominating pair graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Convex and isometric domination of (weak) dominating pair graphs
• scientific article; zbMATH DE number 2188424
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• Hereditary dominating pair graphs
• Computing a dominating pair in an asteroidal triple-free graph in linear time

Cited in

(9)

• Hereditary dominating pair graphs
• Convex and isometric domination of (weak) dominating pair graphs
• On the minimum eccentricity isometric cycle problem
• Well paired-dominated graphs
• Asteroidal sets and dominating paths
• The diameter of AT‐free graphs
• Diametral path graphs
• Pair dominating graphs
• Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem

This page was built for publication: Dominating Pair Graphs

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