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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reciprocal Distance Spectral Polynomial for Join of Two Graphs

D. C. Patil, H.s. Ramane
Turkish Journal of Mathematics and Computer Science
Graph theory and applications
article

Reciprocal Distance Spectral Polynomial for Join of Two Graphs

D. C. Patil, H.s. Ramane
article en

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.

Turkish Journal of Mathematics and Computer ScienceVol. 18(1)
Karnatak University (IN)
Openalex Percentile: Top 42%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.