The Modified Negative Decision Number in Graphs

  title={The Modified Negative Decision Number in Graphs},
  author={Changping Wang},
  journal={Int. J. Math. Mathematical Sciences},
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. 

Similar Papers

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.


Publications referenced by this paper.