Laplace eigenvalues and bandwidth‐type invariants of graphs
From MaRDI portal
Publication:4201395
DOI10.1002/jgt.3190170313zbMath0785.05077MaRDI QIDQ4201395
Publication date: 24 August 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170313
labeling; bandwidth; bounds; random graphs; weighted graph; Laplacian spectrum; Laplacian matrix; Kneser graphs; Ramanujan graphs; Laplace eigenvalues
05C80: Random graphs (graph-theoretic aspects)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
A survey of graph laplacians, A spectral approach to bandwidth and separator problems in graphs, Synchronization in power-law networks, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Optimal linear labelings and eigenvalues of graphs, Two improved algorithms for envelope and wavefront reduction, Synchronization in random networks with given expected degree sequences
Cites Work