A note on path domination

DOI10.7151/DMGT.1917MaRDI QIDQ339493zbMATH OpenOpenAlexFDO

Authors L. Alcón

Publication date 11 November 2016

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1917

zbMATH Keywords

pathsinterval graphschordal graphsdominationgeodesics

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Characterization of graphs dominated by induced paths
• scientific article; zbMATH DE number 2188424
• Domination properties and induced subgraphs
• scientific article; zbMATH DE number 2114506
• Toll path domination in graphs

Cites work

• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 1449370 (Why is no real title available?)
• scientific article; zbMATH DE number 5499517 (Why is no real title available?)
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A characterization of ptolemaic graphs
• A characterization of the interval function of a connected graph
• A note on superbrittle graphs
• Efficient graph representations
• Geodesic Convexity in Graphs
• Graph Classes: A Survey
• On triangle path convexity in graphs
• Representation of a finite graph by a set of intervals on the real line
• The All-Paths Transit Function of a Graph
• The longest path transit function of a graph and betweenness
• Toll convexity
• Topics in Intersection Graph Theory

Cited in

(8)

• Axiomatic characterization of the toll walk function of some graph classes
• Toll number of the Cartesian and the lexicographic product of graphs
• Walk Domination and HHD-Free Graphs
• Characterizations of graph classes via convex geometries: a survey
• A note on path-zero graphs
• The Domination Equivalence Classes of Paths
• Toll number of the strong product of graphs
• The weak-toll function of a graph: axiomatic characterizations and first-order non-definability

This page was built for publication: A note on path domination

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