Discusses harmonic polynomials and indices of jump graphs derived from various graphs, indicating their properties.
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.
No takes yet. Share an insight, caveat, or question.
Naduvath et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: