Vulnerability in graphs: the neighbour-integrity of line graphs. - Vecdi Aytaç (Int. J. Comput. Math., 2005)

Residual Closeness Of Splitting Networks. - Tufan Turaci; Vecdi Aytaç (Ars Comb., 2017)

Binding Number and Wheel Related Graphs. - Vecdi Aytaç; Zeynep Nihan Berberler (Int. J. Found. Comput. Sci., 2017)

Relationships between vertex attack tolerance and other vulnerability parameters. - Vecdi Aytaç; Tufan Turaci (RAIRO Theor. Informatics Appl., 2017)

Comparison of Subgraph Mining Algorithms on Ontologies. - Fatmana Sentürk; Vecdi Aytaç (CITS, 2018)

Closeness centrality in some splitting networks. - Vecdi Aytaç; T. Turac (Comput. Sci. J. Moldova, 2018)

Convolutional auto encoders for sentence representation generation. - Ali Mert Ceylan; Vecdi Aytaç (Turkish J. Electr. Eng. Comput. Sci., 2020)

Disjunctive Total Domination Subdivision Number of Graphs. - Canan Çiftçi; Vecdi Aytaç (Fundam. Informaticae, 2020)

Analysis of Vulnerability of Some Transformation Networks. - Vecdi Aytaç; Tufan Turaci (Int. J. Found. Comput. Sci., 2023)

Correction to: A Graph‑Based Ontology Matching Framework. - Fatmana Sentürk; Vecdi Aytaç (New Gener. Comput., 2023)

Disjunctive Total Domination In Harary Graphs. - Canan Çiftçi; Vecdi Aytaç (Comput. J., 2023)

A Graph-Based Ontology Matching Framework. - Fatmana Sentürk; Vecdi Aytaç (New Gener. Comput., 2024)