Relationship between radio k-chromatic number of graphs and square graphs

Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Laxman Saha
Formato:	article
Lenguaje:	EN
Publicado:	Taylor & Francis Group 2021
Materias:	frequency assignment problem radio k-labeling radio k-number square of graphs span Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/598a864d47d944e5b583d985cdd4f7cb
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:598a864d47d944e5b583d985cdd4f7cb
record_format	dspace
spelling	oai:doaj.org-article:598a864d47d944e5b583d985cdd4f7cb2021-11-04T15:00:41ZRelationship between radio k-chromatic number of graphs and square graphs0972-86002543-347410.1080/09728600.2021.1993730https://doaj.org/article/598a864d47d944e5b583d985cdd4f7cb2021-10-01T00:00:00Zhttp://dx.doi.org/10.1080/09728600.2021.1993730https://doaj.org/toc/0972-8600https://doaj.org/toc/2543-3474Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed as the span of f, and is denoted by The minimum span amongst all radio k-labelings of G is the radio k-chromatic number of G and it is denoted by In this article, we investigate a relationship between the radio k-chromatic number of an arbitrary graph and its square graph. This investigation leads us to the exact value of the radio number for square of graphs with small triameter.Laxman SahaTaylor & Francis Grouparticlefrequency assignment problemradio k-labelingradio k-numbersquare of graphsspanMathematicsQA1-939ENAKCE International Journal of Graphs and Combinatorics, Vol 0, Iss 0, Pp 1-7 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	frequency assignment problem radio k-labeling radio k-number square of graphs span Mathematics QA1-939
spellingShingle	frequency assignment problem radio k-labeling radio k-number square of graphs span Mathematics QA1-939 Laxman Saha Relationship between radio k-chromatic number of graphs and square graphs
description	Let be a simple connected graph with diameter d(G) and k be a positive integer. A radio k-labeling of G is a function such that holds for each pair of distinct vertices u and v of G, where is the distance between u and v in G. The absolute difference of the largest and smallest values in is termed as the span of f, and is denoted by The minimum span amongst all radio k-labelings of G is the radio k-chromatic number of G and it is denoted by In this article, we investigate a relationship between the radio k-chromatic number of an arbitrary graph and its square graph. This investigation leads us to the exact value of the radio number for square of graphs with small triameter.
format	article
author	Laxman Saha
author_facet	Laxman Saha
author_sort	Laxman Saha
title	Relationship between radio k-chromatic number of graphs and square graphs
title_short	Relationship between radio k-chromatic number of graphs and square graphs
title_full	Relationship between radio k-chromatic number of graphs and square graphs
title_fullStr	Relationship between radio k-chromatic number of graphs and square graphs
title_full_unstemmed	Relationship between radio k-chromatic number of graphs and square graphs
title_sort	relationship between radio k-chromatic number of graphs and square graphs
publisher	Taylor & Francis Group
publishDate	2021
url	https://doaj.org/article/598a864d47d944e5b583d985cdd4f7cb
work_keys_str_mv	AT laxmansaha relationshipbetweenradiokchromaticnumberofgraphsandsquaregraphs
_version_	1718444771293265920

Relationship between radio k-chromatic number of graphs and square graphs

Ejemplares similares