Tufan Turaci

According to our database, Tufan Turaci authored at least 14 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2023

Analysis of Vulnerability of Some Transformation Networks.

Vecdi Aytaç, Tufan Turaci

Int. J. Found. Comput. Sci., January, 2023

2021

On the bondage, strong and weak bondage numbers in Complementary Prism Graphs.

Aysun Ozan Aytaç, Tufan Turaci

Comput. Sci. J. Moldova, 2021

2020

On Combining the Methods of Link Residual and Domination in Networks.

Tufan Turaci

Fundam. Informaticae, 2020

2019

Global distribution center number of some graphs and an algorithm.

Rafet Durgut, Hakan Kutucu, Tufan Turaci

RAIRO Oper. Res., 2019

Combining the Concepts of Residual and Domination in Graphs.

Tufan Turaci, Aysun Ozan Aytaç

Fundam. Informaticae, 2019

A heuristic algorithm to find rupture degree in graphs.

Rafet Durgut, Tufan Turaci, Hakan Kutucu

Turkish J. Electr. Eng. Comput. Sci., 2019

2017

Relationships between vertex attack tolerance and other vulnerability parameters.

Vecdi Aytaç, Tufan Turaci

RAIRO Theor. Informatics Appl., 2017

Residual Closeness Of Splitting Networks.

Tufan Turaci, Vecdi Aytaç

Ars Comb., 2017

2016

On the average lower bondage number of a graph.

Tufan Turaci

RAIRO Oper. Res., 2016

The average lower reinforcement number of a graph.

Tufan Turaci, Ersin Aslan

RAIRO Theor. Informatics Appl., 2016

Zagreb Eccentricity Indices Of Cycles Related Graphs.

Tufan Turaci

Ars Comb., 2016

2015

Vulnerability Measures of Transformation Graph <i>G</i>^<i>xy</i>+.

Aysun Ozan Aytaç, Tufan Turaci

Int. J. Found. Comput. Sci., 2015

Vulnerability Of Mycielski Graphs Via Residual Closeness.

Tufan Turaci, Mukaddes Okten

Ars Comb., 2015

2011

Vertex Vulnerability Parameter of Gear Graphs.

Aysun Ozan Aytaç, Tufan Turaci

Int. J. Found. Comput. Sci., 2011