# The Modified Negative Decision Number in Graphs

@article{Wang2011TheMN, title={The Modified Negative Decision Number in Graphs}, author={Changping Wang}, journal={Int. J. Math. Mathematical Sciences}, year={2011}, volume={2011}, pages={135481:1-135481:9} }

- Published in Int. J. Math. Mathematical Sciences 2011
DOI:10.1155/2011/135481

A mapping is called negative if for every The maximum of the values of taken over all negative mappings , is called the modified negative decision number and is denoted by . 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.

#### Citations

##### Publications citing this paper.

## On the signed 2-independence number of graphs

VIEW 5 EXCERPTS

CITES BACKGROUND & RESULTS

HIGHLY INFLUENCED