Maximum Independent Sets Partition of (n,k)-Star Graphs
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 maxi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/8247419 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832568343895212032 |
|---|---|
| author | Fu-Tao Hu |
| author_facet | Fu-Tao Hu |
| author_sort | Fu-Tao Hu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-31163f876b754d3d9b485454eb204cbf |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-31163f876b754d3d9b485454eb204cbf2025-02-03T00:59:14ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/82474198247419Maximum Independent Sets Partition of (n,k)-Star GraphsFu-Tao Hu0School of Mathematical Sciences, Anhui University, Hefei, 230601, ChinaThe (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.http://dx.doi.org/10.1155/2019/8247419 |
| spellingShingle | Fu-Tao Hu Maximum Independent Sets Partition of (n,k)-Star Graphs Complexity |
| title | Maximum Independent Sets Partition of (n,k)-Star Graphs |
| title_full | Maximum Independent Sets Partition of (n,k)-Star Graphs |
| title_fullStr | Maximum Independent Sets Partition of (n,k)-Star Graphs |
| title_full_unstemmed | Maximum Independent Sets Partition of (n,k)-Star Graphs |
| title_short | Maximum Independent Sets Partition of (n,k)-Star Graphs |
| title_sort | maximum independent sets partition of n k star graphs |
| url | http://dx.doi.org/10.1155/2019/8247419 |
| work_keys_str_mv | AT futaohu maximumindependentsetspartitionofnkstargraphs |