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!
|