scientific article; zbMATH DE number 3417498
From MaRDI portal
Publication:5682350
Cites work
Cited in
(only showing first 100 items - show all)- The minimal Laplacian spectral radius of trees with a given diameter
- Algebraic connectivity and doubly stochastic tree matrices
- The Laplacian spectral radius of a graph under perturbation
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
- A tearing-based hybrid parallel banded linear system solver
- Distributed consensus in noncooperative inventory games
- A spectral lower bound for the treewidth of a graph and its consequences
- Laplacian spectrum of weakly quasi-threshold graphs
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- Minimum cuts, girth and a spectral threshold
- Spectra of copies of a generalized Bethe tree attached to any graph
- The minimum Laplacian spread of unicyclic graphs
- On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering
- Eigenvalues and edge-connectivity of regular graphs
- Spanning trees in regular graphs
- Transportation in graphs and the admittance spectrum
- Eigenvalues and expanders
- Spectra of graphs and fractal dimensions. I
- Permanental polynomials of graphs
- Equiarboreal graphs
- On the geometry and Laplacian of a graph
- Eigenvalues, diameter, and mean distance in graphs
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- The symbiotic relationship of combinatorics and matrix theory
- Spectral partitioning with multiple eigenvectors
- Solution of flow problems using unstructured grids on distributed memory platforms
- Laplacian graph eigenvectors
- Laplacian eigenvalues and the maximum cut problem
- Laplacian matrices of graphs: A survey
- Load balancing for the parallel adaptive solution of partial differential equations
- An estimate for the nonstochastic eigenvalues of doubly stochastic matrices
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- The structure of trivalent graphs with minimal eigenvalue gap
- Two improved algorithms for envelope and wavefront reduction
- The local density of triangle-free graphs
- On Cheeger inequalities of a graph
- Graphs, networks, and linear unbiased estimates
- Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems
- A note on limit points for algebraic connectivity
- On graphs with algebraic connectivity equal to minimum edge density
- On spectral integral variations of mixed graphs
- Expanding and forwarding parameters of product graphs
- Lower bounds for the eigenvalues of Laplacian matrices
- Compiling constraint satisfaction problems
- The spectrum of the Laplacian matrix of a balanced binary tree
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Fixed points and stability in the two-network frustrated Kuramoto model
- Modularity maximization using completely positive programming
- Inverse Perron values and connectivity of a uniform hypergraph
- Spectral estimates for infinite quantum graphs
- Augmenting the algebraic connectivity for certain families of graphs
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- Dynamical systems associated with adjacency matrices
- On the von Neumann entropy of a graph
- Geometry of complex networks and topological centrality
- Spectral and structural properties of random interdependent networks
- On the second minimum algebraic connectivity of the graphs whose complements are trees
- On the consensus of homogeneous multi-agent systems with arbitrarily switching topology
- On the eigenvalues of weighted directed graphs
- The complexity of translationally invariant spin chains with low local dimension
- Nodal decompositions of graphs
- Exemplar-based low-rank matrix decomposition for data clustering
- Band-restricted diagonally dominant matrices: computational complexity and application
- Heuristics for synthesizing robust networks with a diameter constraint
- Fast consensus seeking on networks with antagonistic interactions
- The least algebraic connectivity of graphs
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- On edge-rupture degree of graphs
- On two conjectures of spectral graph theory
- On generalized windmill graphs
- New bounds for the signless Laplacian spread
- Combinatorial Perron parameters for trees
- Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis
- Robust consensus control for a class of multi-agent systems via distributed PID algorithm and weighted edge dynamics
- Optimizing network robustness by edge rewiring: a general framework
- Extremal problems on saturation for the family of k-edge-connected graphs
- Computing the smallest eigenpairs of the graph Laplacian
- Spectral radius and \(k\)-connectedness of a graph
- Gaussian noise and the two-network frustrated Kuramoto model
- The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
- Proof of conjecture involving algebraic connectivity and average degree of graphs
- Distributed parameter estimation in unreliable WSNs: quantized communication and asynchronous intermittent observation
- Synchronization in networks with strongly delayed couplings
- Largest eigenvalue of a unicyclic mixed graphs
- On algebraic connectivity and spectral integral variations of graphs
- Algebraic connectivity of interdependent networks
- Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
- Uncovering the overlapping community structure of complex networks by maximal cliques
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Tsypkin and Jury-Lee criteria for synchronization and stability of discrete-time multiagent systems
- Sectorization and configuration transition in airspace design
- On algebraic connectivity of directed scale-free networks
- A note on Merris' conjectures
- Properties of spectra of graphs and line graphs
- On trees with perfect matchings
- The Laplacian eigenvalues of mixed graphs
- The limit points of Laplacian spectra of graphs
- Web document clustering using hyperlink structures
- Graph Laplacians, nodal domains, and hyperplane arrangements
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 Q5682350)