Skolem Number of Cycles and Grid Graphs
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are that distance apart. This concept has naturally been generalized to labellings of other graphs, but always using at most two of any integer label. Given that more than two vertices can be mutually dista...
Guardado en:
Autores principales: | Braxton Carrigan, John Asplund |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Georgia Southern University
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/42dcc40fa20445f9991e4235ad36417e |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Skolem Difference Mean Graphs
por: Selvi,M., et al.
Publicado: (2015) -
Skolem difference mean labeling of disconnected graphs
por: Jeyanthi,P., et al.
Publicado: (2017) -
Some results on skolem odd difference mean labeling
por: Jeyanthi,P, et al.
Publicado: (2016) -
All Graphs with a Failed Zero Forcing Number of Two
por: Luis Gomez, et al.
Publicado: (2021) -
Relationship between radio k-chromatic number of graphs and square graphs
por: Laxman Saha
Publicado: (2021)