Laplace eigenvalues and bandwidth‐type invariants of graphs

DOI10.1002/jgt.3190170313zbMath0785.05077OpenAlexW2157174372MaRDI QIDQ4201395

Bojan Mohar, Martin Juvan

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

zbMATH Keywords

labelingbandwidthboundsrandom graphsweighted graphLaplacian spectrumLaplacian matrixKneser graphsRamanujan graphsLaplace eigenvalues

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Spectral properties of unimodular lattice triangulations ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ Lower bounds for the bandwidth problem ⋮ A survey of graph laplacians ⋮ A spectral approach to bandwidth and separator problems in graphs ⋮ Bandwidth of the product of paths of the same length ⋮ Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity ⋮ Diffusion bank networks and capital flows ⋮ Synchronization in power-law networks ⋮ Continuation methods for approximate large scale object sequencing ⋮ Optimal linear labelings and eigenvalues of graphs ⋮ Synchronization in random networks with given expected degree sequences ⋮ On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ On some properties of the Laplacian matrix revealed by the RCM algorithm ⋮ On the bandwidth of the Kneser graph

Cites Work

• Unnamed Item
• Unnamed Item