- Tytuł:
- On Radio Connection Number of Graphs
- Autorzy:
- Marinescu-Ghemeci, Ruxandra
- Powiązania:
- https://bibliotekanauki.pl/articles/31343294.pdf
- Data publikacji:
- 2019-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
radio connection number
radio coloring
L (2, 1)-connection number
L (2, 1)-connectivity
L (2, 1)-labeling - Opis:
- Given a graph G and a vertex coloring c, G is called l-radio connected if between any two distinct vertices u and v there is a path such that coloring c restricted to that path is an l-radio coloring. The smallest number of colors needed to make G l-radio connected is called the l-radio connection number of G. In this paper we introduce these notions and initiate the study of connectivity through radio colored paths, providing results on the 2-radio connection number, also called L(2, 1)-connection number: lower and upper bounds, existence problems, exact values for known classes of graphs and graph operations.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 3; 705-730
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł