EN
Coloring sums of extensions of certain graphs
Öz
We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\chi(G)$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\chi'$-chromatic sum and $\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\chi'$-chromatic sum and $\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.
Anahtar Kelimeler
Kaynakça
- [1] A. Banerjee, S. Bej, On extension of regular graphs, arXiv:1509.05476v1 [math.CO].
- [2] J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, 2008.
- [3] S. Cabello, M. Jacovac, On the b–chromatic number of regular graphs, Discrete Appl. Math. 159 (2011) 1303–1310.
- [4] G. Chartrand, L. Lesniak, Graphs and Digraphs, CRC Press, 2000.
- [5] J. T. Gross, J. Yellen, Graph Theory and Its Applications, CRC Press, 2006.
- [6] J. E. Hopcroft, R. M. Karp, An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2(4) (1973) 225–231.
- [7] J. Kok, N. K. Sudev, K. P. Chithra, Generalised colouring sums of graphs, Cogent Math. 3(1) (2016) 1–11.
- [8] M. Kouider, A. El Sahili, About b–coloring of regular graphs, Rapport de Recherche, No. 1432, CNRS–Universite Paris Sud–LRI.
Ayrıntılar
Birincil Dil
İngilizce
Konular
Mühendislik
Bölüm
Araştırma Makalesi
Yayımlanma Tarihi
15 Ocak 2018
Gönderilme Tarihi
5 Kasım 2017
Kabul Tarihi
26 Haziran 2017
Yayımlandığı Sayı
Yıl 2018 Cilt: 5 Sayı: 1
APA
Kok, J., & Bej, S. (2018). Coloring sums of extensions of certain graphs. Journal of Algebra Combinatorics Discrete Structures and Applications, 5(1), 19-27. https://doi.org/10.13069/jacodesmath.349383
AMA
1.Kok J, Bej S. Coloring sums of extensions of certain graphs. Journal of Algebra Combinatorics Discrete Structures and Applications. 2018;5(1):19-27. doi:10.13069/jacodesmath.349383
Chicago
Kok, Johan, ve Saptarshi Bej. 2018. “Coloring sums of extensions of certain graphs”. Journal of Algebra Combinatorics Discrete Structures and Applications 5 (1): 19-27. https://doi.org/10.13069/jacodesmath.349383.
EndNote
Kok J, Bej S (01 Ocak 2018) Coloring sums of extensions of certain graphs. Journal of Algebra Combinatorics Discrete Structures and Applications 5 1 19–27.
IEEE
[1]J. Kok ve S. Bej, “Coloring sums of extensions of certain graphs”, Journal of Algebra Combinatorics Discrete Structures and Applications, c. 5, sy 1, ss. 19–27, Oca. 2018, doi: 10.13069/jacodesmath.349383.
ISNAD
Kok, Johan - Bej, Saptarshi. “Coloring sums of extensions of certain graphs”. Journal of Algebra Combinatorics Discrete Structures and Applications 5/1 (01 Ocak 2018): 19-27. https://doi.org/10.13069/jacodesmath.349383.
JAMA
1.Kok J, Bej S. Coloring sums of extensions of certain graphs. Journal of Algebra Combinatorics Discrete Structures and Applications. 2018;5:19–27.
MLA
Kok, Johan, ve Saptarshi Bej. “Coloring sums of extensions of certain graphs”. Journal of Algebra Combinatorics Discrete Structures and Applications, c. 5, sy 1, Ocak 2018, ss. 19-27, doi:10.13069/jacodesmath.349383.
Vancouver
1.Johan Kok, Saptarshi Bej. Coloring sums of extensions of certain graphs. Journal of Algebra Combinatorics Discrete Structures and Applications. 01 Ocak 2018;5(1):19-27. doi:10.13069/jacodesmath.349383