Reciprocal Distance Spectral Polynomial for Join of Two Graphs
Reciprocal distance matrix (Harary matrix) of a connected graph $G$ is $RD(G)=[\frac{1}{d_{ij}}]$ with $d_{ij}$ as distance between vertices $v_i$ and $v_j$. $RD$-spectral polynomial has been studied for join of two regular graphs when both of them are of diameter $\leq2$. Present work focus on the study of $RD$-spectral polynomial for join of any two graphs using the coronal concept.
Authors
- D. C. Patil
- H.s. Ramane
Institutions
- Karnatak University (IN)
Publication Details
- Journal
- Turkish Journal of Mathematics and Computer Science
- Published
- 2026-02-23
- DOI
- https://doi.org/10.47000/tjmcs.1473404
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00