On dynamic colouring of cartesian product of complete graph with some graphs

被引：11

作者：

Kaliraj, K. ^{[1
]}

Kumar, H. Naresh ^{[1
,2
]}

Vivin, J. Vernold ^{[3
]}

机构：

[1] Univ Madras, Ramanujan Inst Adv Study Math, Chennai, Tamil Nadu, India

[2] SASTRA Deemed Univ, Dept Math, SASH, Thanjavur, India

[3] Anna Univ, Dept Math, Univ Coll Engn Nagercoil, Constituent Coll, Nagercoil 629004, Tamil Nadu, India

来源：

JOURNAL OF TAIBAH UNIVERSITY FOR SCIENCE | 2020年 / 14卷 / 01期

关键词：

Dynamic colouring; cartesian product; join and wheel;

D O I：

10.1080/16583655.2020.1713586

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by . We denote the cartesian product of G and H by . In this paper, we find the 2-dynamic chromatic number of cartesian product of complete graph with complete graph , complete graph with complete bipartite graph and wheel graph with complete graph .

引用

页码：168 / 171

页数：4

共 50 条

[1] A note on δ(k)-colouring of the Cartesian product of some graphs
Ellumkalayil, Merlin Thomas
Naduvath, Sudev
[J]. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2022, 7 (01) : 113 - 120
[2] b-colouring the Cartesian product of trees and some other graphs
Maffray, Frederic
Silva, Ana
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (4-5) : 650 - 669
[3] On the Dynamic Coloring of Cartesian Product Graphs
Akbari, S.
Ghanbari, M.
Jahanbekam, S.
[J]. ARS COMBINATORIA, 2014, 114 : 161 - 168
[4] THE THICKNESS OF SOME CARTESIAN PRODUCT GRAPHS
Guo, Xia
Yang, Yan
[J]. ARS COMBINATORIA, 2019, 147 : 97 - 107
[5] Identifying codes in the direct product of a complete graph and some special graphs
Lu, Mei
Xu, Jiale
Zhang, Yi
[J]. DISCRETE APPLIED MATHEMATICS, 2019, 254 : 175 - 182
[6] On safe sets of the Cartesian product of two complete graphs
Kang, Bumtle
Kim, Suh-Ryung
Park, Boram
[J]. ARS COMBINATORIA, 2018, 141 : 243 - 257
[7] The crossing number of the Cartesian product of paths with complete graphs
Ouyang, ZhangDong
Wang, Jing
Huang, YuanQiu
[J]. DISCRETE MATHEMATICS, 2014, 328 : 71 - 78
[8] Embedding Cartesian Product of Some Graphs in Books
YANG JIAO
SHAO ZE-LING
LI ZHI-GUO
[J]. Communications in Mathematical Research, 2018, 34 (03) : 253 - 260
[9] Packing the Cartesian product of two complete graphs with hexagons
Fu, HL
Huang, MH
[J]. UTILITAS MATHEMATICA, 2005, 67 : 129 - 140
[10] CHARACTERIZATION OF THE CARTESIAN PRODUCT OF COMPLETE GRAPHS BY CONVEX SUBGRAPHS
EGAWA, Y
[J]. DISCRETE MATHEMATICS, 1986, 58 (03) : 307 - 309

← 1 2 3 4 5 →