Research Article

Reciprocal Distance Spectral Polynomial for Join of Two Graphs

Volume: 18 Number: 1 February 23, 2026
EN

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.

Keywords

References

  1. Bapat, R.B., Graphs and Matrices, Springer, New York, 1988.
  2. Cui, Z., Liu, B., On Harary matrix, Harary index and Harary energy, MATCH Commun. Math. Comput. Chem., 68(2012) 815–823.
  3. Cvetkovic, D.M., Doob, M., Sachs, H., Spectra of Graphs – Theory and Application, Academic Press, New York, 1980.
  4. Güngör, A.D., Çevik, A.S., On the Harary energy and Harary Estrada index of a graph, MATCH Commun. Math. Comput. Chem., 64(2010) 281–296.
  5. Harary, F., Graph Theory, Narosa Publishing House, New Delhi, 1998.
  6. Ivanciuc, O., Balaban, T.S., Balaban, A.T., Design of topological indices, Part 4, Reciprocal distance matrix, related local vertex invariants and topological indices, J. Math. Chem., 12(1993), 309–318.
  7. Jenezic, D., Milicevic, A., Nikolic, S., Trinajstic, N., Graph Theoretical Matrices in Chemistry, Univ. Kragujevac, Kragujevac, 2007.
  8. McLeman, C., McNicholas, E., Spectra of coronae, Linear Algebra Appl., 435(2011), 998–1007.

Details

Primary Language

English

Subjects

Applied Mathematics (Other)

Journal Section

Research Article

Publication Date

February 23, 2026

Submission Date

April 25, 2024

Acceptance Date

December 3, 2025

Published in Issue

Year 2026 Volume: 18 Number: 1

APA
Patil, D., & Ramane, H. (2026). Reciprocal Distance Spectral Polynomial for Join of Two Graphs. Turkish Journal of Mathematics and Computer Science, 18(1), 216-219. https://doi.org/10.47000/tjmcs.1473404
AMA
1.Patil D, Ramane H. Reciprocal Distance Spectral Polynomial for Join of Two Graphs. TJMCS. 2026;18(1):216-219. doi:10.47000/tjmcs.1473404
Chicago
Patil, Daneshwari, and H.s. Ramane. 2026. “Reciprocal Distance Spectral Polynomial for Join of Two Graphs”. Turkish Journal of Mathematics and Computer Science 18 (1): 216-19. https://doi.org/10.47000/tjmcs.1473404.
EndNote
Patil D, Ramane H (February 1, 2026) Reciprocal Distance Spectral Polynomial for Join of Two Graphs. Turkish Journal of Mathematics and Computer Science 18 1 216–219.
IEEE
[1]D. Patil and H. Ramane, “Reciprocal Distance Spectral Polynomial for Join of Two Graphs”, TJMCS, vol. 18, no. 1, pp. 216–219, Feb. 2026, doi: 10.47000/tjmcs.1473404.
ISNAD
Patil, Daneshwari - Ramane, H.s. “Reciprocal Distance Spectral Polynomial for Join of Two Graphs”. Turkish Journal of Mathematics and Computer Science 18/1 (February 1, 2026): 216-219. https://doi.org/10.47000/tjmcs.1473404.
JAMA
1.Patil D, Ramane H. Reciprocal Distance Spectral Polynomial for Join of Two Graphs. TJMCS. 2026;18:216–219.
MLA
Patil, Daneshwari, and H.s. Ramane. “Reciprocal Distance Spectral Polynomial for Join of Two Graphs”. Turkish Journal of Mathematics and Computer Science, vol. 18, no. 1, Feb. 2026, pp. 216-9, doi:10.47000/tjmcs.1473404.
Vancouver
1.Daneshwari Patil, H.s. Ramane. Reciprocal Distance Spectral Polynomial for Join of Two Graphs. TJMCS. 2026 Feb. 1;18(1):216-9. doi:10.47000/tjmcs.1473404