Minimum degree and dominating paths

DOI10.1002/JGT.22021MaRDI QIDQ2958208zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, Ronald Gould, Michael Jacobson, Douglas B. West

Publication date 1 February 2017

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.22021

zbMATH Keywords

degree thresholddominating pathspanning caterpillar

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Degree sum and vertex dominating paths
• Domination in graphs of minimum degree five
• scientific article; zbMATH DE number 57430
• scientific article; zbMATH DE number 4008435
• Paths, Stars and the Number Three

Cites work

• Connected Domination and Spanning Trees with Many Leaves
• Degree conditions for spanning brooms
• Existence of Δλ-cycles and Δλ-paths
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Neighborhood unions and extremal spanning trees
• On the domination number of a random graph
• Some Theorems on Abstract Graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Spanning Trees with Many Leaves
• Spanning trees: A survey
• Transversal numbers of uniform hypergraphs

Cited in

(10)

• The vertex minimal dominating graph
• Degree sum and vertex dominating paths
• Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
• Finding Minors in Graphs with a Given Path Structure
• Radius, leaf number, connected domination number and minimum degree
• Path eccentricity of graphs
• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
• Parameterized algorithms for eccentricity shortest path problem
• Fine-grained complexity of multiple domination and dominating patterns in sparse graphs
• Fine-grained classification of detecting dominating patterns

This page was built for publication: Minimum degree and dominating paths

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