Classification of Szeged complexity two in unicyclic graphs
This study investigates unicyclic graphs with Szeged complexity 2, providing a structured classification of bipartite unicyclic graphs and categorizing the non-bipartite cases with cycles of lengths 3 and 5. Furthermore, we establish the bounds for the Wiener complexity of bipartite unicyclic graphs possessing the Szeged complexity 2. By refining complexity rankings and analyzing structural differences, this research offers valuable insights for graph-based models in various scientific disciplines.
Authors
- Modjtaba Ghorbani (ORCID: https://orcid.org/0000-0001-5623-9932)
- Matthias Dehmer (ORCID: https://orcid.org/0000-0001-8454-5857)
- Zahra Vaziri
Institutions
- Nankai University (CN)
- Health University of Applied Sciences Tyrol (AT)
- UMIT - Private Universität für Gesundheitswissenschaften, Medizinische Informatik und Technik (AT)
- Swiss Distance University of Applied Sciences (CH)
- AKAD University (DE)
- Shahid Rajaee Teacher Training University (IR)
Publication Details
- Journal
- Applied Mathematics and Computation
- Published
- 2026-10-13
- DOI
- https://doi.org/10.1016/j.amc.2026.130352
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00