Maximum Degree;
Shortest distance;
Proximity Equitable Coloring;
D O I:
10.5269/bspm.63131
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G be a simple, finite, undirected and connected graph. Let S be the set of all vertices of maximum degree in G. The proximity of a vertex u is an element of V (G) is the shortest distance of u from S. Two vertices of G are said to be proximity equitable if their proximity difference is at most 1. In this paper, a study of proximity equitable proper colouring is initiated.
机构:
Department of Mathematics, Joykrishnapur High School (H.S.), TamlukDepartment of Mathematics, Joykrishnapur High School (H.S.), Tamluk
Samanta S.
Pramanik T.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, MidnaporeDepartment of Mathematics, Joykrishnapur High School (H.S.), Tamluk
Pramanik T.
Pal M.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, MidnaporeDepartment of Mathematics, Joykrishnapur High School (H.S.), Tamluk