activity
20032025
most citedNetwork synchronization: Spectral versus statistical properties

101 citations · 212 across the 8 of their papers we have counts for

collaborators

9 papers

math.CO2025

Graph entropy, degree assortativity, and hierarchical structures in networks

Fatihcan M. Atay, Türker Bıyıkoğlu

We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the…

math.CO2015

Castelnuovo-Mumford regularity of graphs

Turker Biyikoglu, Yusuf Civan

We present new combinatorial insights into the calculation of (Castelnuovo-Mumford) regularity of graphs.

cs.DS2014

Structure of conflict graphs in constraint alignment problems and algorithms

Ferhat Alkan, Türker Bıyıkoğlu, Marc Demange +1

We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs , a pair of vertex m…

math.CO2013★ 9 cited

Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation

Turker Biyikoglu, Yusuf Civan

We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching…

math.CO2012★ 8 cited

Vertex decomposable graphs, codismantlability, Cohen-Macaulayness and Castelnuovo-Mumford regularity

Turker Biyikoglu, Yusuf Civan

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its nei…

cond-mat.dis-nn2007★ 101 cited

Network synchronization: Spectral versus statistical properties

Fatihcan M. Atay, Turker Biyikoglu, Juergen Jost

We consider synchronization of weighted networks, possibly with asymmetrical connections. We show that the synchronizability of the networks cannot be directly inferred from their…