The modified negative decision number in graphs

DOI10.1155/2011/135481MaRDI QIDQ539336zbMATH OpenOpenAlexWikidataFDO

Authors Changping Wang

Publication date 27 May 2011

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/226069

zbMATH Keywords

bicliquescliquescyclesmodified negative decision numberpaths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Review text

Summary: A mapping \(x:V\rightarrow \{- 1 , 1\} \) is called negative if \(\sum _{u \in {N\lfloor v\rfloor}}x(u) \leq 1\) . The maximum of the values of \(\sum_{v\in V}x(v) \) taken over all negative mappings \(x\), is called the modified negative decision number and is denoted by \(\beta _{v'}(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.

Recommendations

• The negative decision number in graphs
• Lower negative decision number in a graph
• Negative \(k\)-subdecision numbers in graphs
• Some sharp bounds on the negative decision number of graphs
• Lower against number in graphs

Cites work

• \(E_{11}\) and M theory
• The negative decision number in graphs

Cited in

(7)

• Computational complexity of the negative decision number of graphs
• Note on the negative decision number in digraphs
• The negative decision number in graphs
• On the signed 2-independence number of graphs
• Some sharp bounds on the negative decision number of graphs
• Negative \(k\)-subdecision numbers in graphs
• Lower negative decision number in a graph

This page was built for publication: The modified negative decision number in graphs

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