Chromatic Harmonic Polynomials and Indices of Jump Graphs of Some Graphs
International Journal of Foundations of Computer Science · 13.05.2026 · 1-13
DOI: 10.1142/s0129054126500115 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 13.05.2026. Verfasst von Sudev Naduvath und 3 weiteren Autor:innen.
Abstract (Originalsprache)
The jump graph [Formula: see text] of a graph [Formula: see text] of order [Formula: see text] is the complement graph of the line graph [Formula: see text]. The line graph [Formula: see text] of [Formula: see text] is the graphical realisation of edge adjacency in [Formula: see text] and the jump graph is the graphical realisation of edge independence in [Formula: see text]. In this paper, coloring related harmonic polynomials and topological indices of jump graphs of paths and certain cycle related graphs are discussed.
Zitieren
APA
Naduvath, S., Kok, J., Chithra, K. P., & Ali, A. (2026). Chromatic Harmonic Polynomials and Indices of Jump Graphs of Some Graphs. International Journal of Foundations of Computer Science, 1-13. https://doi.org/10.1142/s0129054126500115
Vancouver
Naduvath S, Kok J, Chithra KP, Ali A. Chromatic Harmonic Polynomials and Indices of Jump Graphs of Some Graphs. International Journal of Foundations of Computer Science. 2026:1-13. doi:10.1142/s0129054126500115
BibTeX
@article{Naduvath2026,
author = {Naduvath, Sudev and Kok, Johan and Chithra, K. P. and Ali, Akbar},
title = {Chromatic Harmonic Polynomials and Indices of Jump Graphs of Some Graphs},
journal = {International Journal of Foundations of Computer Science},
year = {2026},
pages = {1--13},
doi = {10.1142/s0129054126500115}
}
EUVIMED