The Modified Negative Decision Number in Graphs
Changping Wang
International Journal of Mathematics and Mathematical Sciences · 2011
doi:10.1155/2011/135481 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
A mapping x:V→{-1,1} is called negative if ∑u∈N[v]x(u)≤1 for every v∈V. The maximum of the values of ∑v∈Vx(v) taken over all negative mappings x, is called the modified negative decision number and is denoted by βD′(G). In this paper, several sharp upper bounds of this number for a general graph are presented. Exact values of these numbers for cycles, paths, cliques and bicliques are found.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.