Graph spectra in computer science

DOI10.1016/j.laa.2010.11.035zbMath1207.68230OpenAlexW2077856845MaRDI QIDQ627958

Slobodan K. Simic, Dragos Cvetković

Publication date: 4 March 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.11.035

zbMATH Keywords

computer sciencesurvey articleinternetcomplex networksgraph spectrainformation technologyapplications of graph theorycommunication technology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20) Internet topics (68M11)

Related Items

Simplicial degree in complex networks. Applications of topological data analysis to network science, On dynamic network security: a random decentering algorithm on graphs, The domination number and the least \(Q\)-eigenvalue, Perfect state transfer in Grover walks between states associated to vertices of a graph, Signless Laplacian state transfer on \(\mathcal{Q} \)-graphs, Bounds of spectral radii on edge-most outer-planar bipartite graphs, Spectra of bowtie product of graphs, Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal, On spectral radius of graphs with pendant paths, Stationary measures on infinite graphs, State transfer and star complements in graphs, Unimodality of principal eigenvector and its applications, Laplacian eigenvalues of the unit graph of the ring \(\mathbb{Z}_n\), The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge, Another estimation of Laplacian spectrum of the Kronecker product of graphs, The normalized Laplacian spectrum of subdivisions of a graph, Graphs with least eigenvalue \(-2\): ten years on, The least \(Q\)-eigenvalue with fixed domination number, Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs, Green's function in partial subdivision networks, Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets, The signless Laplacian state transfer in coronas, Toward a spectral theory of cellular sheaves, Spectra of \(M\)-edge rooted product of graphs, Spectra of graphs resulting from various graph operations and products: a survey, Spectra of signed graphs, Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph, Hermitian adjacency matrix of the second kind for mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs for small multiprocessor interconnection networks
• Some classes of integral circulant graphs either allowing or not allowing perfect state transfer
• Drawing graphs by eigenvectors: theory and practice
• Perfect state transfer in integral circulant graphs
• Signless Laplacians of finite graphs
• The minimal spectral radius of graphs with a given diameter
• On algebraic graph theory and the dynamics of innovation networks
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Trees with minimal index and diameter at most four
• Ramanujan graphs
• Recent results in the theory of graph spectra
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Spectral embedding of graphs.
• An improved diffusion algorithm for dynamic load balancing.
• Sparse topologies with small spectrum size
• An interrelation between line graphs, eigenvalues, and matroids
• Authoritative sources in a hyperlinked environment
• The eigenspace of the eigenvalue -2 in generalized line graphs and a problem in security of statistical databases
• MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
• Application of some graph invariants to the analysis of multiprocessor interconnection networks
• Generalized line graphs
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• A survey on integral graphs
• On the index of broken wheels
• PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
• A Survey of Eigenvector Methods for Web Information Retrieval
• Performance Analysis of Communications Networks and Systems
• An r-Dimensional Quadratic Placement Algorithm
• How to Draw a Graph
• Efficient schemes for nearest neighbor load balancing
• A new 5‐arc‐transitive cubic graph
• Graphs with least eigenvalue \(-2\): The star complement technique