DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS

被引：0

作者：

Megala, S. ^{[1
]}

Mohanapriya, N. ^{[1
]}

Karthika, R. ^{[1
]}

Kalaivani, R. ^{[1
]}

机构：

[1] Kongunadu Arts & Sci Coll, PG & Res Dept Math, Coimbatore 641029, Tamil Nadu, India

来源：

ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2025年 / 42卷 / 04期

关键词：

dominator chromatic number; lexicographic product; path; triple star; complete graph;

D O I：

10.17654/0974165825023

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A dominator coloring of a graph G is a proper coloring in which every vertex is adjacent to at least one vertex from each color class. The minimum number of colors required to achieve a dominator coloring of G is called the dominator chromatic number, denoted as xd In this paper, we obtain the dominator chromatic number of the lexicographic product of a path with certain graphs.

引用

页码：363 / 380

页数：18

共 12 条

[1]

Aasi Muhammad Shahbaz, 2021, Journal of Mathematics, P1

[2] Dominator Colorings in Some Classes of Graphs [J].

Chellali, Mustapha ;

Maffray, Frederic .

GRAPHS AND COMBINATORICS, 2012, 28 (01) :97-107

[3]

Chen Lian, 2019, Eng. Appl. Sci., P10

[4]

Dey Anumita, 2018, International Journal of Engineering and Advanced Technology, V8, P269

[5]

Gera R. M., 2007, Graph Theory Notes, P947

[6]

Jude Annie Cynthia V., 2021, International Journal of Advance Research, V7, P2044

[7]

Karpagavalli S, 2021, ADV APPL MATH SCI, V20, P1697

[8]

Kavitha K., 2015, International Journal of Pure and Applied Mathematics, V101, P605

[9]

Ma Wenhui, 2017, Lexicographic Product GraphsP [PΝ]are antimagic: AKCE International Journal ofGraphs Combinatorics, P271

[10]

Manjula T., 2021, Journal of Physics, P1

← 1 2 →