The following pages link to Türker Bıyıkoğlu (Q405056):
Displayed 30 items.
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- Four-cycled graphs with topological applications (Q434228) (← links)
- Item:Q405056 (redirect page) (← links)
- Prime graphs, matchings and the Castelnuovo-Mumford regularity (Q670634) (← links)
- Network synchronization: Spectral versus statistical properties (Q858503) (← links)
- Faber-Krahn type inequalities for trees (Q864896) (← links)
- Algebraic connectivity and degree sequences of trees (Q959888) (← links)
- Semiregular trees with minimal Laplacian spectral radius (Q962121) (← links)
- Item:Q405056 (redirect page) (← links)
- Graphs with given degree sequence and maximal spectral radius (Q1010854) (← links)
- Discovering cis-regulatory modules by optimizing barbecues (Q1026216) (← links)
- Item:Q405056 (redirect page) (← links)
- A counterexample to a conjecture of Erdős (Q1613447) (← links)
- A discrete nodal domain theorem for trees (Q1863531) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- Castelnuovo-Mumford regularity of graphs (Q2416443) (← links)
- Graphs of given order and size and minimum algebraic connectivity (Q2427902) (← links)
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems (Q2642409) (← links)
- (Q2856761) (← links)
- (Q3166466) (← links)
- Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences (Q3394467) (← links)
- CRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION (Q3586855) (← links)
- Synchronization of networks with prescribed degree distributions (Q4590471) (← links)
- (Q5207847) (← links)
- (Q5463594) (← links)
- (Q5469422) (← links)
- Semiregular Trees with Minimal Index (Q6214263) (← links)
- Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation (Q6239594) (← links)
- Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs (Q6273367) (← links)
- Bounding the collapsibility number of simplicial complexes and graphs (Q6389681) (← links)