On locating chromatic number of Möbius ladder graphs
Abstract: In this paper, we are dealing with the study of locating chromatic number of Möbius-ladders. We prove that Möbius-ladders Mn with n even has locating chromatic number 4 if n≠6 and 6 if n=6.
Guardado en:
Autores principales: | Sakri,Redha, Abbas,Moncef |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
Materias: | |
Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000300659 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Equitable total chromatic number of splitting graph
por: Jayaraman,G., et al.
Publicado: (2019) -
Some characterization theorems on dominating chromatic partition-covering number of graphs
por: Michael Raj,L. Benedict, et al.
Publicado: (2014) -
On graphs whose chromatic transversal number is two
por: Ayyaswamy,S.K, et al.
Publicado: (2011) -
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
por: Analen Malnegro, et al.
Publicado: (2021) -
An Algorithmic Approach to Equitable Total Chromatic Number of Graphs
por: Vivik J.,Veninstine, et al.
Publicado: (2017)