Chromatic Polynomial of the Repeated Pattern Triangular Ladder Graph
Boletim da Sociedade Paranaense de Matemática · 28.10.2026 · 44 (14) · 1-12
DOI: 10.5269/bspm.85714 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 28.10.2026. Verfasst von Shilpa Aggarwal und 3 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In this paper, we derive an explicit formula for the chromatic polynomial of the repeated pattern triangular ladder graph. A proper coloring of a graph using $\lambda$ colors is called a $\lambda$-coloring. A graph is said to be $\lambda$-colorable if it admits a $\lambda$-coloring. The minimum number of colors required to properly color a graph is called its \emph{chromatic number}. The function that counts the number of proper colorings of a graph using $\lambda$ colors is called the \emph{chromatic polynomial} of the graph.
Zitieren
APA
Aggarwal, S., Rana, P., Sehgal, A., & Bhatia, P. (2026). Chromatic Polynomial of the Repeated Pattern Triangular Ladder Graph. Boletim da Sociedade Paranaense de Matemática, 44(14), 1-12. https://doi.org/10.5269/bspm.85714
Vancouver
Aggarwal S, Rana P, Sehgal A, Bhatia P. Chromatic Polynomial of the Repeated Pattern Triangular Ladder Graph. Boletim da Sociedade Paranaense de Matemática. 2026;44(14):1-12. doi:10.5269/bspm.85714
BibTeX
@article{Aggarwal2026,
author = {Aggarwal, Shilpa and Rana, Pankaj and Sehgal, Amit and Bhatia, Pooja},
title = {Chromatic Polynomial of the Repeated Pattern Triangular Ladder Graph},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
volume = {44},
number = {14},
pages = {1--12},
doi = {10.5269/bspm.85714}
}
EUVIMED