Negative k-subdecision numbers in graphs

zbMATH Open1209.05168MaRDI QIDQ624142FDOQ624142

Authors: A. N. Ghameshlou, Abdollah Khodkar, Reza Saei, Seyed Mahmood Sheikholeslami 

Publication date: 8 February 2011

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• The negative decision number in graphs
• Some sharp bounds on the negative decision number of graphs
• Lower negative decision number in a graph
• The modified negative decision number in graphs
• Minus \(k\)-subdomination in graphs

zbMATH Keywords

negative \(k\)-subdecision functionnegative \(k\)-subdecision numbernegative decision functionnegative decision numbertotal \(k\)-subdominating functiontotal \(k\)-subdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (6)

• The modified negative decision number in graphs
• Some sharp bounds on the negative decision number of graphs
• Lower negative decision number in a graph
• The negative decision number in graphs
• Note on the negative decision number in digraphs
• Computational complexity of the negative decision number of graphs

This page was built for publication: Negative \(k\)-subdecision numbers in graphs

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