scientific article; zbMATH DE number 4208110
From MaRDI portal
Publication:3356330
Recommendations
Cited in
(63)- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- Some minimax problems for graphs
- Laplacian matrices of graphs: A survey
- Towards mesoscale analysis of inter-vehicle communications
- Nodal decompositions of graphs
- Minimum higher eigenvalues of Laplacians on graphs
- Proof of conjectures involving algebraic connectivity of graphs
- Spectral clustering revisited: information hidden in the Fiedler vector
- Perron values and classes of trees
- A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization
- Congestion attacks in payment channel networks
- Exploring the heterogeneity for node importance byvon Neumann entropy
- Step-by-step community detection in volume-regular graphs
- Optimally connected hybrid complex networks with windmill graphs backbone
- Ordering trees and graphs with few cycles by algebraic connectivity
- Continuous relaxations for the traveling salesman problem
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Spectral bisection of graphs and connectedness
- Lower bounds of the Laplacian graph eigenvalues
- The seriation problem in the presence of a double Fiedler value
- Connectedness of graphs arising from the dual Steenrod algebra
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Algebraic connectivity of lollipop graphs: a new approach
- The Laplacian quadratic form and edge connectivity of a graph
- scientific article; zbMATH DE number 493358 (Why is no real title available?)
- On the algebraic connectivity of a double covering graph
- scientific article; zbMATH DE number 2075244 (Why is no real title available?)
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Graph connection Laplacian and random matrices with random blocks
- Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Tight bounds on the algebraic connectivity of a balanced binary tree
- Rigidity of random subgraphs and eigenvalues of stiffness matrices
- On the structure of isometrically embeddable metric spaces
- Emergence of a multilayer structure in adaptive networks of phase oscillators
- A conjecture on algebraic connectivity of graphs
- scientific article; zbMATH DE number 2197892 (Why is no real title available?)
- Hydrodynamic alignment with pressure II. Multi-species
- On graphs with equal algebraic and vertex connectivity
- Graphs with given diameter maximizing the algebraic connectivity
- Learning multi-agent coordination through connectivity-driven communication
- Embedding and the rotational dimension of a graph containing a clique
- Quantifying the structural stability of simplicial homology
- A comparison of centrality measures and their role in controlling the spread in epidemic networks
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Embedding and the first Laplace eigenvalue of a finite graph
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Extreme values of the Fiedler vector on trees
- Learning stability on graphs
- \texttt{PQser:} a Matlab package for spectral seriation
- Laplace eigenvalues of graphs---a survey
- Bridging XAI and spectral analysis to investigate the inductive biases of deep graph networks
- On Radenković and Gutman conjecture for some classes of trees of diameter 5
- Upper bounds for eigenvalues of symmetric substochastic matrices and applications
- Spectral radii of arithmetical structures on cycle graphs
- The algebraic connectivity of graphs with given induced matching number
- The resistance distance of a dual number weighted graph
- Finding optimal weight vectors for ridge function approximation in L^2(D)
- On Radenković and Gutman conjecture for certain classes of trees
- Network connectivity assessment and improvement through relay node deployment
- Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- A note on Fiedler vectors interpreted as graph realizations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3356330)
