Examines reciprocal distance spectral polynomials in graph joins, suggesting new insights into graph properties.
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.
No takes yet. Share an insight, caveat, or question.
Patil et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: