scientific article; zbMATH DE number 3681933
From MaRDI portal
Publication:3877805
Cites work
- Eigenvectors of acyclic matrices
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3312524 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
Cited in
(only showing first 100 items - show all)- On the global offensive alliance number of a graph
- Offensive \(r\)-alliances in graphs
- A tearing-based hybrid parallel banded linear system solver
- Laplacian eigenvalues and partition problems in hypergraphs
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- Defensive k-alliances in graphs
- Graph partitioning by eigenvectors
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- Permanental polynomials of 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
- Optimal linear labelings and eigenvalues of graphs
- Solution of flow problems using unstructured grids on distributed memory platforms
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- Two improved algorithms for envelope and wavefront reduction
- A note on limit points for algebraic connectivity
- Graphs whose positive semi-definite matrices have nullity at most two
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Augmenting the algebraic connectivity for certain families of graphs
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- Geometry of complex networks and topological centrality
- Nodal decompositions of graphs
- Spectral bisection with two eigenvectors
- Largest eigenvalue of a unicyclic mixed graphs
- A spectral approach to the Randić index
- Algebraic connectivity of interdependent networks
- Web document clustering using hyperlink structures
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Graph Laplacians, nodal domains, and hyperplane arrangements
- An efficient communications strategy for finite element methods on the Connection Machine CM-5 system
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- On the strong metric dimension of corona product graphs and join graphs
- On the lower bound of the sum of the algebraic connectivity of a graph and its complement
- Consensus of multi-agent systems via fully distributed event-triggered control
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- Spectral clustering with physical intuition on spring-mass dynamics
- A game of alignment: collective behavior of multi-species
- Perron value and moment of rooted trees
- Spectral clustering revisited: information hidden in the Fiedler vector
- eGHWT: the extended generalized Haar-Walsh transform
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices
- An overview of graph covering and partitioning
- Some properties of the eigenvalues of the net Laplacian matrix of a signed graph
- Null decomposition of unicyclic graphs
- The geometry connectivity of hypergraphs
- Spectral properties of inverse sum indeg index of graphs
- An exact approach for the multi-constraint graph partitioning problem
- Connectivity and eigenvalues of graphs with given girth or clique number
- Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
- Edge-matching graph contractions and their interlacing properties
- Ordering trees and graphs with few cycles by algebraic connectivity
- Vertex-connectivity and eigenvalues of graphs
- A doubly nonnegative relaxation for modularity density maximization
- Clustering based on eigenvectors of the adjacency matrix
- Partitions of networks that are robust to vertex permutation dynamics
- Nonsingular mixed graphs with few eigenvalues greater than two
- Bounds on the bisection width for random \(d\)-regular graphs
- An upper bound on the algebraic connectivity of outerplanar graphs
- Universal completability, least eigenvalue frameworks, and vector colorings
- Schur reduction of trees and extremal entries of the Fiedler vector
- Spectral complexity of directed graphs and application to structural decomposition
- Graphs of given order and size and minimum algebraic connectivity
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- Commute times for a directed graph using an asymmetric Laplacian
- On the sign patterns of the smallest signless Laplacian eigenvector
- Spectral bisection of graphs and connectedness
- Decentralized mining social network communities with agents
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The six classes of trees with the largest algebraic connectivity
- The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
- Laplace spectra of orgraphs and their applications
- Semidefinite spectral clustering
- The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector
- The algebraic connectivity of graphs with given circumference
- A dimensionality reduction framework for detection of multiscale structure in heterogeneous networks
- The algebraic connectivity of graphs with given matching number
- Spectral clustering based on matrix perturbation theory
- Higher-order spectral clustering for geometric graphs
- The seriation problem in the presence of a double Fiedler value
- Natural preconditioning and iterative methods for saddle point systems
- Generalized modularity matrices
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- A Fiedler-like theory for the perturbed Laplacian.
- Localization of dominant eigenpairs and planted communities by means of Frobenius inner products.
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Discrepancy and eigenvalues of Cayley graphs
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
- Algebraic connectivity on a subclass of caterpillars
- Trace optimization and eigenproblems in dimension reduction methods.
- A spectral bound for graph irregularity.
- Hierarchical graph Laplacian eigen transforms
- The least Laplacian eigenvalue of the unbalanced unicyclic signed graphs with k pendant vertices
- State-of-the-art sparse direct solvers
- Fractional diffusion on circulant networks: emergence of a dynamical small world
- General Cheeger inequalities for p-Laplacians on graphs
- Global offensive alliances in graphs
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 Q3877805)