Maximum Independent Sets Partition of ( )- Star Graphs

Fu-Tao Hu

Complexity, 2019, vol. 2019, 1-6

Abstract:

The - star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. However, we have not known the values of these two parameters of the - star graph since it was proposed. In this paper, we show a maximum independent sets partition of - star graph. From that, we can immediately deduce the exact value of the independent number and chromatic number of - star graph.

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

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/8247419.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/8247419.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:complx:8247419

DOI: 10.1155/2019/8247419

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().