Maximum Independent Sets Partition of (n,k)-Star Graphs
Author
Source
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-07-04
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
The (n,k)-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 (n,k)-star graph since it was proposed.
In this paper, we show a maximum independent sets partition of (n,k)-star graph.
From that, we can immediately deduce the exact value of the independent number and chromatic number of (n,k)-star graph.
American Psychological Association (APA)
Hu, Fu-Tao. 2019. Maximum Independent Sets Partition of (n,k)-Star Graphs. Complexity،Vol. 2019, no. 2019, pp.1-6.
https://search.emarefa.net/detail/BIM-1132864
Modern Language Association (MLA)
Hu, Fu-Tao. Maximum Independent Sets Partition of (n,k)-Star Graphs. Complexity No. 2019 (2019), pp.1-6.
https://search.emarefa.net/detail/BIM-1132864
American Medical Association (AMA)
Hu, Fu-Tao. Maximum Independent Sets Partition of (n,k)-Star Graphs. Complexity. 2019. Vol. 2019, no. 2019, pp.1-6.
https://search.emarefa.net/detail/BIM-1132864
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1132864
