Graph spectral techniques in computer sciences
DOI10.2298/AADM111223025AzbMATH Open1289.05266OpenAlexW1992874777MaRDI QIDQ2853261FDOQ2853261
Authors: B. Arsić, Milan Škarić, Dragoš Cvetković, Slobodan K. Simić
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Internet topics (68M11)
Cited In (13)
- Seidel integral complete \(r\)-partite graphs
- Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal
- On dynamic network security: a random decentering algorithm on graphs
- Graph spectra in computer science
- Title not available (Why is that?)
- Neural computation, social networks, and topological spectra
- Integral trees with diameter four
- Graphs with least eigenvalue \(-2\): ten years on
- Distance Laplacian spectra of graphs: a survey
- Graph-based algorithms for phase-type distributions
- Unimodality of principal eigenvector and its applications
- The normalized Laplacian spectrum of subdivisions of a graph
- Hermitian adjacency matrix of the second kind for mixed graphs
This page was built for publication: Graph spectral techniques in computer sciences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853261)