On the radio number for corona of paths and cycles
Radio -coloring of graphs is one of the variations of frequency assignment problem. For a simple connected graph and a positive integer , a radio -coloring is an assignment of positive integers (colors) to the vertices of such that for every pair of distinct vertices and of , the difference between...
Main Authors: | Niranjan P.K., Srinivasa Rao Kola |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.06.006 |
Similar Items
-
Upper bound for radio -chromatic number of graphs in connection with partition of vertex set
by: Laxman Saha
Published: (2020-01-01) -
The -distance chromatic number of trees and cycles
by: Niranjan P.K., et al.
Published: (2019-08-01) -
The Radio numbers of all graphs of order n and diameter n-2
by: Katherine F. Benson, et al.
Published: (2013-11-01) -
Radio Number Associated with Zero Divisor Graph
by: Ali N. A. Koam, et al.
Published: (2020-12-01) -
Radio Number for Fourth Power Paths
by: Alegria, Linda V
Published: (2014)