Publication:4873761
From MaRDI portal
zbMath0840.05059MaRDI QIDQ4873761
Publication date: 22 April 1996
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Unnamed Item, The spectra of wrapped butterfly digraphs, On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs, Unnamed Item, On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Laplace eigenvalues of graphs---a survey, Some eigenvalue properties in graphs (conjectures of Graffiti -- II), Some relations between analytic and geometric properties of infinite graphs, Optimal linear labelings and eigenvalues of graphs, A domain monotonicity theorem for graphs and Hamiltonicity, Spectral partitioning with multiple eigenvectors, Some properties of the spectrum of graphs, Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods, Eigenvalue interlacing and weight parameters of graphs, Laplacian matrices of graphs: A survey, The alternating polynomials and their relation with the spectra and conditional diameters of graphs, Landscapes and their correlation functions, Eigenvalues of a special kind of symmetric block circulant matrices, On the dual distance and the gap of a binary code, Fast Fourier transform for fitness landscapes, The Laplacian spectrum of a graph, Upper bound for the Laplacian graph eigenvalues, Expanding and forwarding, Properties of spectra of graphs and line graphs, The limit points of Laplacian spectra of graphs, Graph Laplacians, nodal domains, and hyperplane arrangements, Hamilton cycles and eigenvalues of graphs, Solving the max-cut problem using eigenvalues, A computational attack on the conjectures of Graffiti: New counterexamples and proofs, Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes, Lower bounds of the Laplacian graph eigenvalues, Laplace spectra of orgraphs and their applications, Unnamed Item, Laplace eigenvalues and bandwidth‐type invariants of graphs
