Title : ( DOMINATED CHROMATIC NUMBER OF SOME KINDS OF THE GENERALIZED HELM GRAPHS )
Authors: FATEMEH PORYOUSEFI , Ahmad Erfanian , mahboube nasiri ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
Let G be a simple graph. The dominated coloring of a graph G is a proper coloring of G such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of G is called the dominated chromatic number of G, denoted by χdom(G). The current study is devoted to investigate the dominated chromatic number of Helm graphs and some kinds of its the generalizations.
Keywords
, dominated chromatic number, domination number, Helm graph.
@article{paperid:1102602,
author = {PORYOUSEFI, FATEMEH and Erfanian, Ahmad and Nasiri, Mahboube},
title = {DOMINATED CHROMATIC NUMBER OF SOME KINDS OF THE GENERALIZED HELM GRAPHS},
journal = {Communications in Combinatorics and Optimization},
year = {2024},
month = {December},
issn = {2538-2128},
keywords = {dominated chromatic number; domination number; Helm graph.},
}
%0 Journal Article
%T DOMINATED CHROMATIC NUMBER OF SOME KINDS OF THE GENERALIZED HELM GRAPHS
%A PORYOUSEFI, FATEMEH
%A Erfanian, Ahmad
%A Nasiri, Mahboube
%J Communications in Combinatorics and Optimization
%@ 2538-2128
%D 2024
