Algebraic connectivity and disjoint vertex subsets of graphs
From MaRDI portal
Publication:2193366
DOI10.1155/2020/5763218zbMath1459.05189MaRDI QIDQ2193366
Publication date: 25 August 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/5763218
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C09: Graphical indices (Wiener index, Zagreb index, Randi? index, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- On the pseudo-inverse of the Laplacian of a bipartite graph
- Old and new results on algebraic connectivity of graphs
- Eigenvalues and expanders
- Recent results in the theory of graph spectra
- The matrix-forest theorem and measuring relations in small social groups
- Laplacian eigenvalues and the maximum cut problem
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
- On a duality between metrics and \(\Sigma\)-proximities
- On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks
- On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
- Graph Spectra for Complex Networks
- THE HOSOYA INDEX OF GRAPHS FORMED BY A FRACTAL GRAPH
- Geometry and spectra of compact Riemann surfaces
- On graphs with equal algebraic and vertex connectivity
