101 citations · 212 across the 8 of their papers we have counts for
6 papers · 1 filter
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…
Castelnuovo-Mumford regularity of graphs
Turker Biyikoglu, Yusuf Civan
We present new combinatorial insights into the calculation of (Castelnuovo-Mumford) regularity of graphs.
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…
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…
Graphs with Given Degree Sequence and Maximal Spectral Radius
Tuerker Biyikoglu, Josef Leydold
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degr…
Faber-Krahn Type Inequalities for Trees
Tuerker Biyikoglu, Josef Leydold
The Faber-Krahn theorem states that among all bounded domains with the same volume in (with the standard Euclidean metric), a ball that has lowest first Dirichlet e…