Pages that link to "Item:Q1175553"
From MaRDI portal
The following pages link to Eigenvalues, diameter, and mean distance in graphs (Q1175553):
Displayed 50 items.
- On the spectral gap of a quantum graph (Q312228) (← links)
- On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs (Q317939) (← links)
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment (Q340665) (← links)
- Trivial points on towers of curves (Q394275) (← links)
- Random generators of the symmetric group: diameter, mixing time and spectral gap. (Q468709) (← links)
- Laplacian spread of graphs: lower bounds and relations with invariant parameters (Q498342) (← links)
- Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh-Rose neurons (Q529524) (← links)
- Eigenvalues and diameter (Q546361) (← links)
- On mean distance and girth (Q608268) (← links)
- Design of highly synchronizable and robust networks (Q620598) (← links)
- From ternary strings to Wiener indices of benzenoid chains (Q678878) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers (Q783731) (← links)
- Lower bounds of the Laplacian spectrum of graphs based on diameter (Q861000) (← links)
- Modified logarithmic Sobolev inequalities in discrete settings (Q867071) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Computing tight upper bounds on the algebraic connectivity of certain graphs (Q958040) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Algebraic connectivity and doubly stochastic tree matrices (Q1002267) (← links)
- The Laplacian spectral radius of a graph under perturbation (Q1005808) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Average distance in graphs and eigenvalues (Q1025982) (← links)
- Minimum cuts, girth and a spectral threshold (Q1029057) (← links)
- Ordering trees by the Laplacian coefficients (Q1039751) (← links)
- Mechanisms for local search (Q1266572) (← links)
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs (Q1270774) (← links)
- Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Computing the average distance of an interval graph (Q1334633) (← links)
- The alternating polynomials and their relation with the spectra and conditional diameters of graphs (Q1356468) (← links)
- From local adjacency polynomials to locally pseudo-distance-regular graphs (Q1366602) (← links)
- A new upper bound for the isoperimetric number of de Bruijn networks (Q1375854) (← links)
- Boundary graphs. II: The limit case of a spectral property (Q1379827) (← links)
- On graphs with algebraic connectivity equal to minimum edge density (Q1414127) (← links)
- Wiener index versus maximum degree in trees (Q1613418) (← links)
- Augmenting the algebraic connectivity for certain families of graphs (Q1634763) (← links)
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach (Q1680667) (← links)
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication (Q1689381) (← links)
- Output consensus for heterogeneous nonlinear multi-agent systems based on T-S fuzzy model (Q1697662) (← links)
- Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem (Q1737781) (← links)
- Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis (Q1740109) (← links)
- Maximizing Wiener index for trees with given vertex weight and degree sequences (Q1740236) (← links)
- The number of spanning forests of a graph (Q1772421) (← links)
- A Wiener-type graph invariant for some bipartite graphs (Q1904516) (← links)
- Proof of conjectures involving algebraic connectivity of graphs (Q1947091) (← links)
- Shortest paths in distance-regular graphs (Q1971798) (← links)
- On the Laplacian spectrum of \(k\)-uniform hypergraphs (Q2085415) (← links)
- New conjectures on algebraic connectivity and the Laplacian spread of graphs (Q2144238) (← links)
- On the spectrum of hypergraphs (Q2229474) (← links)
- Diffusion bank networks and capital flows (Q2230764) (← links)