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, Unnamed Item, Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics, An efficient method for decomposition of regular structures using graph products, 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), Drawing graphs by eigenvectors: theory and practice, Spectral properties of the Laplacian on bond-percolation graphs, Upper bounds on algebraic connectivity via convex optimization, Minimizing the Laplacian eigenvalues for trees with given domination number, Spectral partitioning works: planar graphs and finite element meshes, On the Laplacian coefficients of acyclic graphs, 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, Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics, Graph coloration and group theory for factorization of symmetric dynamic systems, Consistency of spectral clustering, The effect on the algebraic connectivity of a tree by grafting or collapsing of edges, The ordering of trees and connected graphs by algebraic connectivity, Lower bounds of the Laplacian graph eigenvalues, Laplace spectra of orgraphs and their applications, Spectral measure of large random Hankel, Markov and Toeplitz matrices, Lifshitz tails for spectra of Erdős-Rényi random graphs, Bounding the gap between extremal Laplacian eigenvalues of graphs, Connections between Wiener index and matchings, One-dimensional layout optimization, with applications to graph drawing by axis separation, Laplacian spectral bounds for clique and independence numbers of graphs, The distance spectrum of a tree, Augmented canonical forms and factorization of graphs, Unnamed Item, Laplace eigenvalues and bandwidth‐type invariants of graphs
