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.
Vaziri, Z. (2025). On the characterization of tricyclic graphs with Szeged complexity one. Journal of Discrete Mathematics and Its Applications, 10(4), 393-401. doi: 10.22061/jdma.2025.12502.1161
MLA
Vaziri, Z. . "On the characterization of tricyclic graphs with Szeged complexity one", Journal of Discrete Mathematics and Its Applications, 10, 4, 2025, 393-401. doi: 10.22061/jdma.2025.12502.1161
HARVARD
Vaziri, Z. (2025). 'On the characterization of tricyclic graphs with Szeged complexity one', Journal of Discrete Mathematics and Its Applications, 10(4), pp. 393-401. doi: 10.22061/jdma.2025.12502.1161
CHICAGO
Z. Vaziri, "On the characterization of tricyclic graphs with Szeged complexity one," Journal of Discrete Mathematics and Its Applications, 10 4 (2025): 393-401, doi: 10.22061/jdma.2025.12502.1161
VANCOUVER
Vaziri, Z. On the characterization of tricyclic graphs with Szeged complexity one. Journal of Discrete Mathematics and Its Applications, 2025; 10(4): 393-401. doi: 10.22061/jdma.2025.12502.1161
)
)