Eigenvalues, diameter, and mean distance in graphs

From MaRDI portal

Publication:1175553

Jump to:navigation, search

DOI10.1007/BF01789463zbMath0771.05063MaRDI QIDQ1175553

Bojan Mohar

Publication date: 25 June 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

eigenvalues bounds diameter adjacency matrix Laplacian matrix mean distance diagonal matrix

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Wiener index versus maximum degree in trees, Perron components and algebraic connectivity for weighted graphs, Computing the average distance of an interval graph, Augmenting the algebraic connectivity for certain families of graphs, On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs, On the spectral gap of a quantum graph, New conjectures on algebraic connectivity and the Laplacian spread of graphs, On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs, Lower bounds for the algebraic connectivity of graphs with specified subgraphs, The alternating polynomials and their relation with the spectra and conditional diameters of graphs, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, On the bounds of Laplacian eigenvalues of k-connected graphs, A Wiener-type graph invariant for some bipartite graphs, Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment, Lower bounds of the Laplacian spectrum of graphs based on diameter, From local adjacency polynomials to locally pseudo-distance-regular graphs, Modified logarithmic Sobolev inequalities in discrete settings, On the Wiener index, distance cospectrality and transmission-regular graphs, Expected value of the one-dimensional earth mover's distance, A new upper bound for the isoperimetric number of de Bruijn networks, Old and new results on algebraic connectivity of graphs, Boundary graphs. II: The limit case of a spectral property, An edge version of the matrix-tree theorem and the wiener index, On mean distance and girth, Distributed optimal in-network resource allocation algorithm design via a control theoretic approach, Trivial points on towers of curves, Continuous mean distance of a weighted graph, Design of highly synchronizable and robust networks, A survey of graph laplacians, Eigenvalues and the diameter of graphs, Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication, Distributed cooperative optimization for multiple heterogeneous Euler-Lagrangian systems under global equality and inequality constraints, Output consensus for heterogeneous nonlinear multi-agent systems based on T-S fuzzy model, Mean distance on metric graphs, A lower bound for algebraic connectivity based on the connection-graph-stability method, On the sum of the Laplacian eigenvalues of a tree, Proof of conjectures involving algebraic connectivity of graphs, Spectral Identification of Networks Using Sparse Measurements, On graphs with algebraic connectivity equal to minimum edge density, Can one hear the spanning trees of a quantum graph?, A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs, Hitting Times, Cover Cost, and the Wiener Index of a Tree, Analytic connectivity of k-uniform hypergraphs, On the diameter of permutation groups., Random generators of the symmetric group: diameter, mixing time and spectral gap., Shortest paths in distance-regular graphs, On the spectrum of hypergraphs, Diffusion bank networks and capital flows, Ordering trees with algebraic connectivity and diameter, Algebraic connectivity of weighted trees under perturbation, Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem, Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis, Maximizing Wiener index for trees with given vertex weight and degree sequences, Laplacian spread of graphs: lower bounds and relations with invariant parameters, From ternary strings to Wiener indices of benzenoid chains, A new algorithm for domain decomposition of finite element models, Laplace eigenvalues of graphs---a survey, Computing tight upper bounds on the algebraic connectivity of certain graphs, Ordering trees and graphs with few cycles by algebraic connectivity, Effects of network structure on the synchronizability of nonlinearly coupled Hindmarsh-Rose neurons, A survey of automated conjectures in spectral graph theory, Localized patterns in homogeneous networks of diffusively coupled reactors, Eigenvalues and diameter, The number of spanning forests of a graph, Bounding the gap between extremal Laplacian eigenvalues of graphs, On partial contraction analysis for coupled nonlinear oscillators, Swarming behaviors in multi-agent systems with nonlinear dynamics, Connections between Wiener index and matchings, The distance spectrum of a tree, Algebraic connectivity and doubly stochastic tree matrices, The Laplacian spectral radius of a graph under perturbation, Bounds on the subdominant eigenvalue involving group inverse with applications to graphs, Eigenvalue Ratios of Non-Negatively Curved Graphs, A spectral lower bound for the treewidth of a graph and its consequences, Quantum 3-SAT Is QMA$_1$-Complete, Mechanisms for local search, The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs, Average distance in graphs and eigenvalues, Minimum cuts, girth and a spectral threshold, Ordering trees by the Laplacian coefficients, Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers, Notes on the betweenness centrality of a graph, On the Laplacian spectrum of \(k\)-uniform hypergraphs, Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods, Lower bounds for the least Laplacian eigenvalue of unbalanced blocks, Laplacian matrices of graphs: A survey

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1175553&oldid=12005467"