Zeynep Nihan Berberler

Orcid: 0000-0001-9179-3648

According to our database1, Zeynep Nihan Berberler authored at least 15 papers between 2017 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
Generalized entropies of subdivision-corona networks.
Discret. Math. Algorithms Appl., August, 2024

Node and Link Vulnerability in Complete Multipartite Networks.
Int. J. Found. Comput. Sci., June, 2024

2023
Isolated Rupture in Composite Networks.
Int. J. Found. Comput. Sci., June, 2023

Quasi-Laplacian energy of composite graphs.
Discret. Math. Algorithms Appl., May, 2023

2022
Isolated Rupture in Thorny Networks.
Int. J. Found. Comput. Sci., 2022

2021
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks.
Int. J. Found. Comput. Sci., 2021

2020
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks.
Int. J. Found. Comput. Sci., 2020

Independent strong domination in complementary prisms.
Electron. J. Graph Theory Appl., 2020

Independent strong weak domination: A mathematical programming approach.
Discret. Math. Algorithms Appl., 2020

2019
A Note on the Link Residual Closeness of Graphs Under Join Operation.
Int. J. Found. Comput. Sci., 2019

2018
Network robustness and residual closeness.
RAIRO Oper. Res., 2018

Link Vulnerability in Networks.
Int. J. Found. Comput. Sci., 2018

2017
Robustness of Regular Caterpillars.
Int. J. Found. Comput. Sci., 2017

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

Measuring the vulnerability in networks: a heuristic approach.
Ars Comb., 2017


  Loading...