What does this research mean for the field?

The reciprocal distance spectral polynomial can be studied for the join of any two graphs using the coronal concept. Novelty: ClaimNovelty.NOVEL_FINDING. Consensus alignment: ConsensusAlignment.NEUTRAL.

What question did this study set out to answer?

The aim is to investigate the reciprocal distance spectral polynomial for the join of any two graphs, extending previous findings on regular graphs.

February 25, 2026Open Access

Reciprocal Distance Spectral Polynomial for Join of Two Graphs

Puntos clave

The aim is to investigate the reciprocal distance spectral polynomial for the join of any two graphs, extending previous findings on regular graphs.
Analyzed the reciprocal distance matrix of connected graphs.
Applied the concept of coronal structures to the study of spectral polynomials.
Focused on joins of various graph types regardless of their diameter.
Developed a comprehensive formulation for the RD-spectral polynomial of graph joins.
Revealed that the coronal concept enhances the analysis of varying graph structures.
Demonstrated potential applications for diverse connected graphs in spectral theory.

Resumen

Reciprocal distance matrix (Harary matrix) of a connected graph G is RD (G) =1d₈₉ with d₈₉ as distance between vertices vᵢ and vⱼ. RD-spectral polynomial has been studied for join of two regular graphs when both of them are of diameter 2. Present work focus on the study of RD-spectral polynomial for join of any two graphs using the coronal concept.

Me gusta

Guardar

Ver artículo completo