| Título: | Independent Number and Dominating Number of (n,k)-Star Graphs |
| Autores: |
Wei, Yunchao; Shanghai Ocean University, Shanghai Chen, Fuguang; Shanghai Ocean University, Shanghai Zhu, Hongxian; Shanghai Ocean University, Shanghai |
| Fecha: | 2013-01-01 |
| Publicador: | TELKOMNIKA: Indonesian journal of electrical engineering |
| Fuente: |
 |
| Tipo: |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
| Tema: | No aplica |
| Descripción: | 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 . |
| Idioma: | Inglés |