SavedAdd your journal

Journals / Hacettepe Journal of Mathematics and Statistics / 2026 / Volume: 42 Issue: 1

Bounds for Resistance–Distance Spectral Radius

A. Dilek Güngör Maden
İvan Gutman
A. Sinan Çevik
Pages
—
Publication Date
2013-01-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.
📊
Key Findings & Data:Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.
💡
Conclusion & Impact:Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Metric (in graph) · Resistance Distance · Resistance-Distance Spectral Radius

Abstract

Lower and upper bounds as well as Nordhauss-Gaddum-type results forthe resistance–distance spectral radius are obtained.

🔖

Cite This Article

Maden, A. D. G., Gutman, İ., Çevik, A. S. (2013). Bounds for Resistance–Distance Spectral Radius. Hacettepe Journal of Mathematics and Statistics, Volume: 42 Issue: 1. https://ajindex.com/articles/1403500

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (31)

  1. Balaban, A. T., Ciubotariu, D. and Medeleanu, M. Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors, J. Chem. Inf. Comput. Sci. 31, 517-523, 1991.
  2. Bapat R. B. Resistance distance in graphs, Math. Student 68, 87-98, 1999.
  3. Bapat R. B. Resistance matrix of a weighted graph, MATCH Commun. Math. Comput. Chem. 50, 73-82, 2004.
  4. Bapat R. B., Gutman, I. and Xiao, W. A simple method for computing resistance distance, Z. Naturforsch. 58a, 494-498, 2003.
  5. Bendito, E., Carmona, A., Encinas, A. M, Gesto, J. M. and Mitjana, M Kirchhoff indexes of a network, Lin. Algebra Appl. 432, 2278-2292, 2010.
  6. Bonchev, D., Balaban, A. T., Liu, X. and Klein, D. J. Molecular cyclicity and centricity of polycyclic graphs. I. Cyclicity based on resistance distances or reciprocal distances, Int. J. Quantum Chem. 50, 1-20, 1994.
  7. Cao, D., Chvatal, V, Hoffman, A, J. and Vince, A. Variations on a theorem of Ryser, Lin. Algebra Appl. 260, 215-222, 1997.
  8. Chen, H. and Zhang, F. Resistance distance and the normalized Laplacian spectrum, Discr. Appl. Math. 155, 654-661, 2007.
  9. Das, K. C., G¨ ung¨ or, A. D. and C ¸ evik, A. S., On the Kirchoff index and the resistence distance energy of a graph, MATCH Commun. Math. Comput. Chem. 67(2), 541-556, 2012. Dobrynin, A. A., Entringer, R. and Gutman, I. Wiener index of trees: theory and applications, Acta Appl. Math. 66, 211-249, 2001.
  10. Entringer, R. C., Jackson, D. E. and Snyder, D. A. Distance in graphs, Czech. Math. J. 26, 283-296, 1976.
  11. Guo, Q., Deng, H. and Chen, D. The extremal Kirchhoff index of a class of unicyclic graphs, MATCH Commun. Math. Comput. Chem. 61, 713-722, 2009.
  12. Gutman, I. and Medeleanu, M. On the structure–dependence of the largest eigenvalue of the distance matrix of an alkane, Indian J. Chem. 37A, 569-573, 1998.
  13. Gutman, I. and Xiao, W. Generalized inverse of the Laplacian matrix and some applications, Bull. Acad. Serbe Sci. Arts (Cl. Sci. Math. Natur. 129, 15-23, 2004.
  14. Gutman, I. and Xiao, W. Distance in trees and Laplacian matrix, Int. J. Chem. Model. 2, 327-334,2010.
  15. Ivanciuc, O., Ivanciuc, T. and Balaban, A. T. Quantitative structure–property relationship evaluation of structural descriptors derived from the distance and reverse Wiener matrices, Internet El. J. Mol. Des. 1, 467-487,2002.
  16. Klein, D. J. Graph geometry, graph metrics, & Wiener, MATCH Commun. Math. Comput. Chem. 35, 7-27, 1997.
  17. Klein, D. J. and Randi´ c, M. Resistance distance, J. Math. Chem. 12, 81-95, 1993.
  18. Lukovits, I. Nikoli´ c, S. and Trinajsti´ c, N. Resistance distance in regular graphs, Int. J. Quantum Chem. 71, 217-225, 1999.
  19. Nordhaus, E. A. and Gaddum, J. W. On complementary graphs, Am. Math. Montly 63, 175-177, 1956.
  20. Walikar, H. B., Misale, D. N., Patil, R. L. and Ramane, H. S. On the resistance distance of a tree, El. Notes Discr. Math. 15, 244-245, 2003.
  21. Xiao, W. and Gutman, I. On resistance matrices, MATCH Commun. Math. Comput. Chem. 49, 67-81, 2003.
  22. Xiao, W. and Gutman, I. Resistance distance and Laplacian spectrum, Theor. Chem. Acc. 110, 284-289, 2003.
  23. Xiao, W. and Gutman, I. Relations between resistance and Laplacian matrices and their applications, MATCH Commun. Math. Comput. Chem. 51, 119-127, 2004.
  24. Zhang, H., Jiang, X. and Yang, Y. Bicyclic graphs with extremal Kirchhoff index, MATCH Commun. Math. Comput. Chem. 61, 697-712, 2009.
  25. Zhang, H. and Yang, Y. Resistance distance and Kirchhoff index in circulant graphs, Int. J. Quantum Chem. 107, 330-339, 2007.
  26. Zhang, H., Yang, Y. and Li, C. Kirchhoff index of composite graphs, Discr. Appl. Math. 157, 2918-2927, 2009.
  27. Zhang, W. and Deng, H. The second maximal and minimal Kirchhoff indices of unicyclic graphs, MATCH Commun. Math. Comput. Chem. 61, 683-695, 2009.
  28. Zhou, B. On the spectral radius of nonnegative matrices, Australas. J. Comb. 22, 301-306, 2000.
  29. Zhou, B. and Liu, B. On almost regular matrices, Util. Math. 54, 151-155, 1998.
  30. Zhou, B. and Trinajsti´ c, N. On the largest eigenvalue of the distance matrix of a connected graph, Chem. Phys. Lett. 447, 384-387, 2007.
  31. Zhou, B, and Trinajsti´ c, N. On resistance–distance and Kirchhoff index, J. Math. Chem. 46, 283-289, 2009.