SavedAdd your journal

Journals / Turkish Journal of Mathematics and Computer Science / 2026 / Volume: 18 Issue: 3

Attitude of Some Graph Invariants under Edge Reformulations of Graph

Fatma El-Safty(Damanhour University)0000-0002-4437-0594
Pages
—
Publication Date
2026-10-13
🏛️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)

These formulas are expressed in terms of graph invariants of G.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The graphs Tk(G) and Tk(G) are defined to be the subdivision of the k-inflation and k-triangulation of G, respectively.
📊
Key Findings & Data:In this paper, formulas for the number of spanning trees and Kirchhoff indices of these graphs are obtained.
💡
Conclusion & Impact:These formulas are expressed in terms of graph invariants of G.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Laplacian polynomial · normalized Laplacian polynomial · number of spanning trees

Abstract

Let G be a graph. The graphs Tk(G) and Tk(G) are defined to be the subdivision of the k-inflation and k-triangulation of G, respectively. In this paper, formulas for the number of spanning trees and Kirchhoff indices of these graphs are obtained. These formulas are expressed in terms of graph invariants of G.

🔖

Cite This Article

El-Safty, F. (2026). Attitude of Some Graph Invariants under Edge Reformulations of Graph. Turkish Journal of Mathematics and Computer Science, Volume: 18 Issue: 3. https://doi.org/10.47000/tjmcs.1874206

📄 Full Text PDF Viewer

📄

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

References (30)

  1. Aboutahoun, A.W., El-Safty, F., Tutte polynomial of self-similar network models with applications, Ars Combin., 157(2023), 53–63.
  2. Akdim, M., Drissi, A., A comprehensive review of graph theory applications in secret sharing schemes, J. Comb. Math. Comb. Comput., 123(2024), 61–73.
  3. Bapat, R.B., Graphs and Matrices, Springer, London, 2010.
  4. Bondy, J.A., Murty, U.S.R., Graph Theory and Its Application, Macmillan, London, 1976.
  5. Chen, H., Zhang, F. (2007), Resistance distance and the normalized Laplacian spectrum, Discrete Appl. Math., 155(2007), 654–661.
  6. Cvetkovic, D.M., Doob, M., Sachs, H., Spectra of Graphs, Academic Press, New York, 1980.
  7. El-Safty, F., Laplacian polynomial and Kirchhoff index of some graphs generated by a cycle, Art Discrete Appl. Math., 8(2025), ID 03.
  8. El-Safty, F., Aboutahoun, A.W., Number of spanning trees of iterated triangulation of a graph, Adv. Appl. Discrete Math., 42(2025), 1–16.
  9. Gao, X., Luo, Y.F., Liu, W.W., Kirchhoff index in line, subdivision and total graphs of a regular graph, Discrete Appl. Math., 160(2012), 560–565.
  10. Geng, X., Lei, Y., On the Kirchhoff index and the number of spanning trees of linear phenylenes chain, Polycycl. Aromat. Comp., 42(2022), 4984–4993.
  11. Gutman, I., Feng, L., Yu, L., Degree resistance distance of unicyclic graphs, Trans. Comb., 1(2012), 27–40.
  12. Gutman, I., Mohar, B., The quasi-Wiener and the Kirchhoff indices coincide, J. Chem. Inf. Comput. Sci., 36(1996), 982–985.
  13. He, C., Li, S., Luo, W., Sun, L., Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains, J. Comput. Appl. Math., 344(2018), 381–393.
  14. Horn, R.A., Johnson, C.R., Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.
  15. Hu, X., Sun, L., Zheng, R., Xia, X., Liu, M., Chen, W., Zhang, X., Wang C., Application of graph theory in liver research: A review, Port. Hypertens. Cirrhos., 3(2024), 234–248.
  16. Kelmans, A.K., Chelnokov V.M., Certain polynomials of a graph and graphs with an extremal number of trees, J. Comb. Theory, Ser. B, 16(1974), 197–214.
  17. Klein, D.J., Randi´c, M., Resistance distance, J. Math. Chem., 12(1993), 81–95.
  18. Liao, Y., Xie, X., Hou, Y., Alaoui, M.A.A., Tutte polynomials of two self-similar network models, J. Stat. Phys., 174(2019), 893–905.
  19. Liu, Q., Resistance distance and Kirchhoff index of the diamond hierarchical graph and the generalized corona graph, IAENG Int. J. Appl. Math., 50(2020), 878–882.
  20. Liu, J.B., Cao, J., The Laplacian polynomial and Kirchhoff index of graphs based on R-graphs, Neurocomputing, 177(2016), 441–446.
  21. Liu, J.B., Peng, X.B., Gu, J.J., Lin, W., The (multiplicative degree-) Kirchhoff index of graphs derived from the Cartesian product of S n and K2, J. Math., 2022(2022), ID 1670984.
  22. Ma, F., Yao, B., An iteration method for computing the total number of spanning trees and its applications in graph theory, Theor. Comput. Sci., 708(2018), 46–57.
  23. Palacios, J.L., Computing the additive degree–Kirchhoff index with the Laplacian matrix, Iran. J. Math. Chem., 8(2017), 285–290.
  24. Sahir, M.A., Abu Nayeem, S.M., On the Kirchhoff index and the number of spanning trees of cylinder/M¨obius pentagonal chain, Discrete Appl. Math., 326(2023), 47-61.
  25. Svarcmajer, M., Ivanovic, D., Rudec, T., Lukic, I., Application of graph theory and variants of greedy graph coloring algorithms for optimization of distributed peer-to-peer blockchain networks, Technologies, 13(2025), ID 33.
  26. Tu, Y., Ma, X., Zhang, Y., Ren, J., On the Laplacian, the Kirchhoff index, and the number of spanning trees of the linear pentagonal derivation chain, Axioms, 11(2022), ID 278.
  27. Wang, W., Yang, D., Luo, Y., The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs, Discrete Appl. Math., 161(2013), 3063-3071.
  28. Xie, P., Zhang, Z., Comellas, F., On the spectrum of the normalized Laplacian of iterated triangulations of graphs, Appl. Math. Comput., 273(2016), 1123–1129.
  29. Yang, Y., The Kirchhoff index of subdivisions of graphs, Discrete Appl. Math., 171(2014), 153–157.
  30. Yang, Y., Klein, D.J., A note on the Kirchhoff and additive degree-Kirchhoff indices of graphs, Z. Naturforsch, 70(2015), 459–463.