Graph Spectra for Complex Networks
From MaRDI portal
Cited in
(21)- An approximation algorithm for the maximum spectral subgraph problem
- Detection of hubs in complex networks by the Laplacian matrix
- Algebraic connectivity and disjoint vertex subsets of graphs
- Modeling and analyzing the dynamic spreading of epidemic malware by a network eigenvalue method
- Spectra of graphs resulting from various graph operations and products: a survey
- The minimum spectral radius of an edge-removed network: a hypercube perspective
- Quantum transport on large-scale sparse regular networks by using continuous-time quantum walk
- An efficient and effective generic agglomerative hierarchical clustering approach
- A unified framework for structured graph learning via spectral constraints
- Contagion dynamics in multilayer networks with community structure
- Resilience to the financial crisis in customer-supplier networks
- On the spectral properties of Feigenbaum graphs
- On the normalized Laplacian spectra of random geometric graphs
- Resistance between two nodes of a ring clique network
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- Spectrum of super commuting graphs of some finite groups
- Oscillatory networks: insights from piecewise-linear modeling
- Per-spectral characterizations of bicyclic networks
- Energetic formulation of the subgroup commutativity degree
- Coclique level structure for stochastic chemical reaction networks
- Spectral plot properties: towards a qualitative classification of networks
This page was built for publication: Graph Spectra for Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903269)
