Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Journal Article
Open Access
The b-chromatic number of some special families of graphs
Jeeva A
,
Selvakumar R
,
Nalliah M
Published in IOP Publishing
2017
DOI:
10.1088/1757-899X/263/4/042113
Volume: 263
Issue: 4
Abstract
Given G, b - coloring is a proper k coloring of G in which each and every color class has at least one b - vertex that has a neighbour in other k - 1 color classes. The largest integer k is the b - chromatic number b(G) for which G having a b - coloring using k colors. In this paper, we constructed some family of graphs and found its b - chromatic number. © Published under licence by IOP Publishing Ltd.
Download
PDF
Publisher Copy
Cite
Publisher Copy Version
Content may be subject to copyright,
Check License
This is a gold open access article under cc-by license
This is a gold open access article under cc-by license
PDF
References (5)
Journal Details
Authors (2)
About the journal
Journal
Data powered by Typeset
IOP Conference Series: Materials Science and Engineering
Publisher
Data powered by Typeset
IOP Publishing
ISSN
1757-8981
Open Access
Yes
Authors (2)
Selvakumar R
Department of Mathematics
School of Advanced Sciences
Vellore Campus
Recent publications
Efficient data reconstruction in sensor networks using optimal locally recoverable codes
Fundamental circuits and cut-sets used in cryptography
Evaluation of decoding trade-offs of concatenated RS convolutional codes and turbo codes via trellis
Algorithms for Drawing Planar p-petal Graphs
Nalliah M
Department of Mathematics
School of Advanced Sciences
Vellore Campus
Recent publications
ANTIMAGIC LABELING OF DIGRAPHS
The b-chromatic number of some special families of graphs
Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs
Get all the updates for this publication
Follow