Goksen Bacak-Turan

According to our database, Goksen Bacak-Turan authored at least 11 papers between 2004 and 2025.

Collaborative distances:

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

2025

Fuzzy node rupture degree of some fuzzy graph families.

Ferhan Nihan Murater, Goksen Bacak-Turan

RAIRO Oper. Res., 2025

2020

Domination integrity and efficient fuzzy graphs.

Saravanan Mariappan, Sujatha Ramalingam, Sundareswaran Raman, Goksen Bacak-Turan

Neural Comput. Appl., 2020

2017

Neighbor Rupture Degree of Transformation Graphs Gxy-.

Goksen Bacak-Turan, Ekrem Oz

Int. J. Found. Comput. Sci., 2017

2016

Neighbor Rupture Degree of Harary Graphs.

Ferhan Nihan Altundag, Goksen Bacak-Turan

Int. J. Found. Comput. Sci., 2016

2015

Neighbor Rupture Degree of a Graph with Maximum Connectivity.

Goksen Bacak-Turan, Ferhan Nihan Altundag

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

Graph Operations and Neighbor Rupture Degree.

Saadet KandIlcI, Goksen Bacak-Turan, Refet Polat

J. Appl. Math., 2013

Neighbor Integrity of Transformation Graphs.

Goksen Bacak-Turan, Alpay Kirlangic

Int. J. Found. Comput. Sci., 2013

2011

Neighbor Rupture Degree And The Relations Between Other Parameters.

Goksen Bacak-Turan, Alpay Kirlangic

Ars Comb., 2011

2007

Applying Mathematica and webMathematica to graph coloring.

Ünal Ufuktepe, Goksen Bacak

Future Gener. Comput. Syst., 2007

2005

Applications of Graph Coloring.

Ünal Ufuktepe, Goksen Bacak

Proceedings of the Computational Science and Its Applications, 2005

2004

Graph Coloring with web Mathematica.

Ünal Ufuktepe, Goksen Bacak, Tina Beseri

Proceedings of the Computational Science, 2004