Independent Number and Dominating Number of (n,k)-Star Graphs

Yunchao Wei, Fuguang Chen, Hongxian Zhu

Abstract


In Graph Theory, independent number and, dominating number are three of the important parameters to measure the resilience of graphs, respectively denoted by  and  for a graph . But predecessors have proved that computing them are very hard. So computing  and of some particular known graphs is extremely valuable. In this paper, we determine  and of -star graphs, denoted by , followed by some relative conclusions of -star, denoted by  as the isomorphism of . In addition, our method giving dominating set of  is more easily understood than [7], which presented a broadcast algorithm to determine dominating set of.

 

DOI: http://dx.doi.org/10.11591/telkomnika.v11i1.1901


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

The Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics