✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Present work focus on the study of $RD$-spectral polynomial for join of any two graphs using the coronal concept.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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$.
📊
Key Findings & Data: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$.
💡
Conclusion & Impact:Present work focus on the study of $RD$-spectral polynomial for join of any two graphs using the coronal concept.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Join of two graphs · $RD$-matrix · RD-spectral polynomial.
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.
🔖
Cite This Article
Patil, D., Ramane, H. (2026). Reciprocal Distance Spectral Polynomial for Join of Two Graphs. Turkish Journal of Mathematics and Computer Science, Volume: 18 Issue: 1. https://doi.org/10.47000/tjmcs.1473404