پیوندهای مفید
آمار
| تعداد نشریات | 11 |
| تعداد شمارهها | 234 |
| تعداد مقالات | 2,381 |
| تعداد مشاهده مقاله | 3,802,086 |
| تعداد دریافت فایل اصل مقاله | 2,763,590 |
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 | ||
|
آمار تعداد مشاهده مقاله: 115 تعداد دریافت فایل اصل مقاله: 293 |
||