EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Coloring sums of extensions of certain graphs

Johan Kok, Saptarshi Bej

Journal of Algebra Combinatorics Discrete Structures and Applications · 15.01.2018 · 5 (1) · 19-27

DOI: 10.13069/jacodesmath.349383 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebra Combinatorics Discrete Structures and Applications, online erschienen am 15.01.2018. Verfasst von Johan Kok und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

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

Vancouver

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

BibTeX
@article{Kok2018,
  author = {Kok, Johan and Bej, Saptarshi},
  title = {Coloring sums of extensions of certain graphs},
  journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
  year = {2018},
  volume = {5},
  number = {1},
  pages = {19--27},
  doi = {10.13069/jacodesmath.349383}
}
Kostenlos starten →