Lower negative decision number in a graph

DOI10.1007/S12190-009-0327-5MaRDI QIDQ711530zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The negative decision number in graphs
• The modified negative decision number in graphs
• Note on the negative decision number in digraphs
• Lower against number in graphs
• Negative \(k\)-subdecision numbers in graphs
• Some sharp bounds on the negative decision number of graphs
• Computational complexity of the negative decision number of graphs
• Graphs with small negative inertia index
• The signed bad numbers in graphs
• LOWER BOUNDS OF SIGNED DOMINATION NUMBER OF A GRAPH

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1109397 (Why is no real title available?)
• scientific article; zbMATH DE number 861417 (Why is no real title available?)
• A note on the lower bounds of signed domination number of a graph
• Signed Total Domination Nnumber of a Graph
• Signed domination in regular graphs
• Signed total domination in graphs.
• Some more remarks on domination in cubic graphs
• The negative decision number in graphs
• The signed \(k\)-domination numbers in graphs.
• The signed star domination numbers of the Cartesian product graphs
• \(E_{11}\) and M theory

Cited in

(9)

• Computational complexity of the negative decision number of graphs
• Note on the negative decision number in digraphs
• Some sharp bounds on the negative decision number of graphs
• Negative \(k\)-subdecision numbers in graphs
• Lower against number in graphs
• The signed bad numbers in graphs
• The modified negative decision number in graphs
• A correction on the signed bad number
• The negative decision number in graphs

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

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