Downhill domination problem in graphs

DOI10.1016/j.ipl.2015.02.003zbMath1329.05226OpenAlexW2083128215MaRDI QIDQ2345854

Shinya Fujita, Xue-gang Chen

Publication date: 21 May 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.02.003

zbMATH Keywords

combinatorial problemslinear time algorithmdirect dominating setdownhill domination number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

DOWNHILL DOMINATION IN GRAPHS UNDER BINARY OPERATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• An implicit degree condition for Hamiltonian graphs
• On perfect packings in dense graphs
• Downhill domination in graphs

This page was built for publication: Downhill domination problem in graphs