|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
H. T. Gölpek, A. Aytaç, “Determining vulnerability of central networks using closeness and Nordhaus–Gaddum type relation”, Math. Notes, 116:4 (2024), 614–626  |
|
2021 |
| 2. |
C. Çiftçi, A. Aytaç, “A Vulnerability Parameter of Networks”, Math. Notes, 109:4 (2021), 517–526    |
|
2020 |
| 3. |
C. Çiftçi, A. Aytaç, “Porous Exponential Domination in Harary Graphs”, Math. Notes, 107:2 (2020), 231–237  |
5
|
|
2013 |
| 4. |
A. Aytaç, T. Turaci, Z. N. Odabas, “On The Bondage Number of Middle Graphs”, Mat. Zametki, 93:6 (2013), 803–811  ; Math. Notes, 93:6 (2013), 795–801 |
13
|
|
2005 |
| 5. |
P. Dündar, A. Aytaç, V. Aytaç, “Calculation of the Accessibility Number and the Neighbor Integrity of a Graph”, Mat. Zametki, 78:5 (2005), 676–686 ; Math. Notes, 78:5 (2005), 631–640 |
4
|
|
2004 |
| 6. |
P. Dündar, A. Aytaç, “Integrity of Total Graphs via Certain Parameters”, Mat. Zametki, 76:5 (2004), 714–722 ; Math. Notes, 76:5 (2004), 665–672 |
17
|
|
| Organisations |
|
|
Contact us: