On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication
From MaRDI portal
Publication:2437359
Recommendations
Cites work
- scientific article; zbMATH DE number 5575533 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A short proof of interlacing inequalities on normalized Laplacians
- An Interlacing Result on Normalized Laplacians
- Bounds for the least Laplacian eigenvalue of a signed graph
- Hamilton cycles and eigenvalues of graphs
- Interlacing eigenvalues and graphs
- Matrix Analysis
- On the Laplacian Eigenvalues of Signed Graphs
- On the notion of balance of a signed graph
- On the spectrum of the normalized graph Laplacian
- Signed graphs
- Signed graphs, root lattices, and Coxeter groups
- Synchronization in discrete-time networks with general pairwise coupling
- Synchronization of networks with prescribed degree distributions
Cited in
(19)- More on spectral analysis of signed networks
- On the symmetry of the Laplacian spectra of signed graphs
- On the normalized Laplacians with some classical parameters involving graph transformations
- Spectral preorder and perturbations of discrete weighted graphs
- On the multiple eigenvalue of Randić matrix of trees
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
- On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
- On the spectrum of the normalized graph Laplacian
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication
- A class of posets with integral Laplacian spectrum
- Edge-matching graph contractions and their interlacing properties
- Spectral distances on graphs
- A HYBRID MEMBERSHIP LATENT DISTANCE MODEL FOR UNSIGNED AND SIGNED INTEGER WEIGHTED NETWORKS
- Spectral gap of the largest eigenvalue of the normalized graph Laplacian
- The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
- Spectral theory for dynamics on graphs containing attractive and repulsive interactions
- The spectra of signed graphs obtained by \(\dot{H}\)-(generalized) join operation
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
This page was built for publication: On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437359)