Proximity equitability Colouring in graphs

被引：0

作者：

Neelakantan, S. ^{[1
]}

Swaminathan, V. ^{[2
]}

Sundareswaran, R. ^{[3
]}

Venkatesh, K. A. ^{[4
]}

机构：

[1] Wayfair, Boston, MA 02116 USA

[2] Saraswathi Narayanan Coll, Ramanujan Res Ctr Math, Madurai, India

[3] Sri Sivasubramaniya Nadar Coll Engn, Dept Math, Chennai, India

[4] Chanakya Univ, Sch Math & Nat Sci, Bangalore, India

来源：

BOLETIM SOCIEDADE PARANAENSE DE MATEMATICA | 2025年 / 43卷

关键词：

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.

引用

页数：5

共 50 条

[1] Colouring proximity graphs in the plane
Discrete Math, 1-3 (123-137):
[2] Colouring proximity graphs in the plane
McDiarmid, C
Reed, B
DISCRETE MATHEMATICS, 1999, 199 (1-3) : 123 - 137
[3] Secure equitability in graphs
Muthusubramanian, L.
Sundareswaran, R.
Swaminathan, V.
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (02)
[4] Colouring semirandom graphs
Coja-Oghlan, Amin
COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (04): : 515 - 552
[5] Colouring graphs with bounded generalized colouring number
Zhu, Xuding
DISCRETE MATHEMATICS, 2009, 309 (18) : 5562 - 5568
[6] Flip colouring of graphs
Caro, Yair
Lauri, Josef
Mifsud, Xandru
Yuster, Raphael
Zarb, Christina
GRAPHS AND COMBINATORICS, 2024, 40 (06)
[7] Colouring of distance graphs
Voigt, M
ARS COMBINATORIA, 1999, 52 : 3 - 12
[8] L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs
Rani, A. Vimala
IAENG International Journal of Computer Science, 2024, 51 (11) : 1740 - 1749
[9] Colouring exact distance graphs of chordal graphs
Quiroz, Daniel A.
DISCRETE MATHEMATICS, 2020, 343 (05)
[10] Colouring AT-Free Graphs
Kratsch, Dieter
Mueller, Haiko
ALGORITHMS - ESA 2012, 2012, 7501 : 707 - 718

← 1 2 3 4 5 →