The Modified Negative Decision Number in Graphs

Changping Wang

International Journal of Mathematics and Mathematical Sciences, 2011, vol. 2011, 1-9

Abstract:

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.

Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2011/135481.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2011/135481.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:135481

DOI: 10.1155/2011/135481

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().