پیوندهای مفید
آمار
| تعداد نشریات | 15 |
| تعداد شمارهها | 239 |
| تعداد مقالات | 2,430 |
| تعداد مشاهده مقاله | 4,047,882 |
| تعداد دریافت فایل اصل مقاله | 2,939,777 |
On the characterization of tricyclic graphs with Szeged complexity one | ||
| Journal of Discrete Mathematics and Its Applications | ||
| مقاله 6، دوره 10، شماره 4، اسفند 2025، صفحه 393-401 اصل مقاله (401.03 K) | ||
| نوع مقاله: Full Length Article | ||
| شناسه دیجیتال (DOI): 10.22061/jdma.2025.12502.1161 | ||
| نویسنده | ||
| Zahra Vaziri* | ||
| Department of Mathematics, Factually of Science, Shahid Rajaee Teacher Training University, Tehran, I. R. Iran | ||
| تاریخ دریافت: 22 شهریور 1404، تاریخ بازنگری: 18 مهر 1404، تاریخ پذیرش: 02 آذر 1404 | ||
| چکیده | ||
| This paper presents a classification of 12 out of 15 known families of tricyclic graphs based on their Szeged complexity. It is shown that only two of these families contain graphs with Szeged complexity equal to one. Building on previous structural analyses of unicyclic and bicyclic graphs, this study extends the classification framework to include a substantial portion of tricyclic configurations. The results contribute to a deeper understanding of graph complexity and lay the groundwork for further exploration of cyclic graph structures. | ||
| کلیدواژهها | ||
| Szeged complexity؛ Szeged contribution؛ tricyclic graphs | ||
| مراجع | ||
|
[1] A. Abiad, B. Brimcov, A. Erey, L. Leshock, X. Martinez-Rivera, S. O, S.-Y. Song, J. Williford, On the Wiener index, distance cospectrality and transmission-regular graphs, Discrete Appl. Math. 230 (2017) 1–10. https://doi.org/10.1016/j.dam.2017.07.010 [2] Y. Alizadeh, Szeged dimension and PIv dimension of composite graphs, Iranian J. Math. Sci. Inform. 13 (2018) 45–57. http://ijmsi.ir/article-1-796-en.html [3] Y. Alizadeh, V. Andova, S. Klavˇ zar, R. ˇ Skrekovski, Wiener dimension: Fundamental properties and (5,0)-nanotubical fullerenes, MATCH Commun. Math. Comput. Chem. 72 (2014) 279–294. https://match.pmf.kg.ac.rs/electronic versions/Match72/n1/match72n1 279-294.pdf [4] Y. Alizadeh, S. Klavˇ zar, Complexity of the Szeged index, edge orbits, and some nanotubical fullerenes, Hacet. J. Math. Stat. 49 (2020) 87–95. https://doi.org/10.15672/HJMS.2019.664 [5] Y. Alizadeh, S. Klavˇ zar, On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs, Appl. Math. Comput. 328 (2018) 113–118. https://doi.org/10.1016/j.amc.2018.01.039 [6] H. Dong, B. Zhou, Szeged index of bipartite unicyclic graphs, J. Math. Nano Sci. 1 (2011) 13-24. https://doi.org/10.22061/jmns.2011.459 [7] M. Ghorbani, Z. Vaziri, Graphs with small distance-based complexities, Appl. Math. Comput. 457 (2023) 128188. https://doi.org/10.1016/j.amc.2023.128188 [8] M. Ghorbani, Z. Vaziri, On the Szeged and Wiener complexities in graphs, Appl. Math. Comput. 470 (2024) 128532. https://doi.org/10.1016/j.amc.2024.128532 [9] M. Ghorbani, Z. Vaziri, M. Dehmer, Complexity measures in trees: a comparative investigation of Szeged and Wiener indices, Comp. Appl. Math. 44 (2025) 195. https://doi.org/10.1007/s40314025-03159-1 [10] I. Gutman, AformulafortheWienernumberoftreesanditsextensiontographscontainingcycles, Graph Theory Notes N. Y. 27 (1994) 9–15. [11] S. Klavˇ zar, D. Azubha Jemilet, I. Rajasingh, P. Manuel, N. Parthiiban, General transmission lemma and Wiener complexity of triangular grids, Appl. Math. Comput. 338 (2018) 115–122. https://doi.org/10.1016/j.amc.2018.05.056 [12] I. Lukovits, Szeged index: Formulas for fused bicyclic graphs, Croat. Chem. Acta 70 (1997) 863871. https://hrcak.srce.hr/135653 [13] S. Simi´c, I. Gutman, V. Baltic, Some graphs with extremal Szeged index, Math. Slovaca 50 (2000) 1–15. https://dml.cz/handle/10338.dmlcz/128935 [14] K. Xu, A. Ili´c, V. Irˇsiˇc, S. Klavˇ zar, H. Li, Comparing Wiener complexity with eccentric complexity, Discrete Appl. Math. 290 (2021) 7–16. https://doi.org/10.48550/arXiv.1905.05968 | ||
|
آمار تعداد مشاهده مقاله: 173 تعداد دریافت فایل اصل مقاله: 336 |
||