Lower negative decision number in a graph

DOI10.1007/S12190-009-0327-5zbMath1221.05276OpenAlexW2039741721MaRDI QIDQ711530

Changping Wang

Publication date: 26 October 2010

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-009-0327-5

zbMATH Keywords

regular graphnegative decision numberbad functionlower negative decision numbermaximal bad functionnearly regular graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• The signed star domination numbers of the Cartesian product graphs
• A note on the lower bounds of signed domination number of a graph
• Signed total domination in graphs.
• Signed domination in regular graphs
• Signed Total Domination Nnumber of a Graph
• E ₁₁ and M theory
• Some more remarks on domination in cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower negative decision number in a graph