Reciprocal Distance Spectral Polynomial for Join of Two Graphs
Abstract
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.
Fields of Study & Subjects
Graph theory and applications
Matrix Theory and Algorithms
Graph Theory and Algorithms
Publication details
- Journal / source
- Turkish Journal of Mathematics and Computer Science
- Volume
- 18
- Issue
- 1
- Pages
- 216–219
- Publication date
- 23 February 2026
- Language
- EN