On b-Chromatic Number fora Certain Triangular Line graphs

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Home

On b-Chromatic Number fora Certain Triangular Line graphs

Author:

PRALAHAD MAHAGAONKAR

Affiliation:

Asso. Professor, in Mathematics, Department of Mathematics, Ballari Institute of Technology and Management,
Ballari Karnataka 583104 India

Corresponding Author Email:-pralahadpralhad@yahoo.com

Keyword:

b-chromatic, triangular line graph, cycles, coloring,

Issue Date:

January, 2017

Abstract:

The b-Chromatic number of a graph is the maximum number of k of colors that can be used to color the vertices of G. Let us consider the color classes for differentline graphs, where every line graphs with i has a representative (the color i dominating vertex) that is able to communicate with all the other line graphs. Further we investigate the b-chromatic number for certain triangular graphs such as triangular snake graphs, triangular fan graphs, triangular cylindrical graphs andwe also generalized some of the results based on these graphs.

Pages:

11-14

ISSN:

2319-8044 (Online) - 2231-346X (Print)

Source:

Vol.29 - No.1

PDF:

Click here to download full paper

DOI:

http://dx.doi.org/10.22147/jusps-A/290102

Share This:

Copy the following to cite this article:

PRALAHAD MAHAGAONKAR, "On b-Chromatic Number fora Certain Triangular Line graphs", Journal of Ultra Scientist of Physical Sciences, Volume 29, Issue 1, Page Number 11-14, 2017

Copy the following to cite this URL:

PRALAHAD MAHAGAONKAR, "On b-Chromatic Number fora Certain Triangular Line graphs", Journal of Ultra Scientist of Physical Sciences, Volume 29, Issue 1, Page Number 11-14, 2017

Available from: https://www.ultrascientist.org/paper/752/

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License