Graph spectral techniques in computer sciences
From MaRDI portal
Publication:2853261
DOI10.2298/AADM111223025AzbMath1289.05266OpenAlexW1992874777MaRDI QIDQ2853261
Branko Arsić, Milan Škarić, Dragos Cvetković, Slobodan K. Simic
Publication date: 18 October 2013
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm111223025a
Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Internet topics (68M11)
Related Items (8)
On dynamic network security: a random decentering algorithm on graphs ⋮ Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal ⋮ Unimodality of principal eigenvector and its applications ⋮ The normalized Laplacian spectrum of subdivisions of a graph ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Integral trees with diameter four ⋮ Seidel integral complete \(r\)-partite graphs ⋮ Hermitian adjacency matrix of the second kind for mixed graphs
This page was built for publication: Graph spectral techniques in computer sciences
