Vecdi Aytaç

Orcid: 0000-0002-0038-6180

According to our database1, Vecdi Aytaç authored at least 12 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Graph-Based Ontology Matching Framework.
New Gener. Comput., March, 2024

2023
Disjunctive Total Domination In Harary Graphs.
Comput. J., December, 2023

Correction to: A Graph‑Based Ontology Matching Framework.
New Gener. Comput., March, 2023

Analysis of Vulnerability of Some Transformation Networks.
Int. J. Found. Comput. Sci., January, 2023

2020
Disjunctive Total Domination Subdivision Number of Graphs.
Fundam. Informaticae, 2020

Convolutional auto encoders for sentence representation generation.
Turkish J. Electr. Eng. Comput. Sci., 2020

2018
Closeness centrality in some splitting networks.
Comput. Sci. J. Moldova, 2018

Comparison of Subgraph Mining Algorithms on Ontologies.
Proceedings of the 2018 International Conference on Computer, 2018

2017
Relationships between vertex attack tolerance and other vulnerability parameters.
RAIRO Theor. Informatics Appl., 2017

Binding Number and Wheel Related Graphs.
Int. J. Found. Comput. Sci., 2017

Residual Closeness Of Splitting Networks.
Ars Comb., 2017

2005
Vulnerability in graphs: the neighbour-integrity of line graphs.
Int. J. Comput. Math., 2005


  Loading...