THE b-CHROMATIC NUMBER OF HELM GRAPH
Main Article Content
Abstract
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
Akbar Ali., M.M, Vivin, J.V., Harmonious chromatic
number of central graph of complete graph families,
Journal of Combinatorics, Information and System
Sciences, no. 1- 4 (combined) 32, 2007, 221–231.
Balakrishnan, R., Raj, S.F., Bounds for the b-chromatic
number of the Mycielskian of some families of graphs.
Ars Combinatoria, 122, 2015, pp. 89-96.
Chaouche, F., Berrachedi, A., Some bounds for the bchromatic
number of a generalized Hamming graphs, Far
East J. Appl. Math. 26, 2007, 375–391.
Corteel, S., Valencia-Pabon, M., Vera, J.C., On
approximating the b-chromatic number. Discrete Applied
Mathematics, 146(1), 2005, 106-110.
Harary, F., Graph Theory, Narosa Publishing home, 2001.
Hoang, C.T., Kouider, M., On the b-dominating coloring
of graphs, Discrete Applied Maths, 152 no.1-3, 2005,
-186.
Kouider, M., Maheo, M., Some bounds for the bchromatic
number of a graph, Discrete Math. 256, 2002,
-277.
Kouider, M., b-chromatic number, subgraphs and degrees,
Technical Report N1392, LRI, Universite de Paris Swd,
Kouider, M., Zaker, M., Bounds for the b-chromatic
number of some families of graphs. Discrete Math. 306,
, 617-623.
Kouider, M., Maheo, M, The b-Chromatic number of
Cartesian product of two graphs, Studia Sci. Math.
Hungar. 44, 2007, 49-55.
Kratochvil, J., Tuza, Z., Voigt, M., On the b-chromatic
number of graphs. In International Workshop on Graph-
Theoretic Concepts in Computer Science, Springer Berlin
Heidelberg, 2002, pp. 310-320.
R. Irving and D. Manlove, The b-chromatic number of a
graph. Discrete Appl. Math. 91, 1999, 127-141.
Vijayalaksmi, D., Thialagavathi, K, Roopesh, N., A note
on b-chromatic number of star graph families Bulletin of
Pure and Applied Sciences Volume 30 Issue No. 1, 2011,
-24.
Vivin, J.V., Venkatachalam, M., The b-chromatic number
of corona graphs, Utilitas Mathematicae 88, 2012, 299-
Vivin, J.V., Vekatachalam, M., On b-chromatic number
of sun let graph and wheel graph families. Journal of the
Egyptian Mathematical Society, 23(2), 2015, pp. 215-218.