scientific article
From MaRDI portal
Publication:3877805
zbMath0437.15004MaRDI QIDQ3877805
Publication date: 1975
Full work available at URL: https://eudml.org/doc/12900
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Web document clustering using hyperlink structures, Discrete quantitative nodal theorem, A lower bound for the algebraic connectivity of a graph in terms of the domination number, eGHWT: the extended generalized Haar-Walsh transform, Generalized modularity matrices, Bounds on the max and min bisection of random cubic and random 4-regular graphs, Trees with matrix weights: Laplacian matrix and characteristic-like vertices, Graph Laplacians, nodal domains, and hyperplane arrangements, Augmenting the algebraic connectivity for certain families of graphs, An overview of graph covering and partitioning, On the multiplicity of Laplacian eigenvalues and Fiedler partitions, The Laplacian spread of unicyclic graphs, Upper bounds on the bisection width of 3- and 4-regular graphs, Some properties of the eigenvalues of the net Laplacian matrix of a signed graph, General Cheeger inequalities for \(p\)-Laplacians on graphs, Lower bounds of the Laplacian spectrum of graphs based on diameter, On the algebraic connectivity of graphs as a function of genus, An efficient communications strategy for finite element methods on the Connection Machine CM-5 system, Two improved algorithms for envelope and wavefront reduction, Graph partitioning by eigenvectors, On trees with exactly one characteristic element, Spectral partitioning works: planar graphs and finite element meshes, Latent semantic analysis and Fiedler retrieval, On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph, New spectral lower bounds on the bisection width of graphs, The smallest values of algebraic connectivity for unicyclic graphs, Geometry of complex networks and topological centrality, Spectral clustering and its use in bioinformatics, On the eigenvalues of general sum-connectivity Laplacian matrix, The influence of Miroslav Fiedler on spectral graph theory, 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, Nodal decompositions of graphs, Structural properties of the minimum cut of partially-supplied graphs, Spectral bisection with two eigenvectors, A reductive approach to hypergraph clustering: an application to image segmentation, Graph spectra in computer science, Null decomposition of unicyclic graphs, Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs, The geometry connectivity of hypergraphs, Gromov hyperbolic cubic graphs, A spectral characterization of the Delaunay triangulation, The algebraic connectivity of lollipop graphs, Spectral properties of inverse sum indeg index of graphs, Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain, On the strong metric dimension of corona product graphs and join graphs, A note on limit points for algebraic connectivity, Graphs whose positive semi-definite matrices have nullity at most two, Permanental polynomials of graphs, Hearing the clusters of a graph: A distributed algorithm, Spectral radius and Hamiltonian graphs, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Graph clustering, On the Laplacian spread of graphs, Ordering trees with nearly perfect matchings by algebraic connectivity, On edge singularity and eigenvectors of mixed graphs, On the geometry and Laplacian of a graph, Eigenvalues, diameter, and mean distance in graphs, Metric uniformization and spectral bounds for graphs, Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra, The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs, The symbiotic relationship of combinatorics and matrix theory, \texttt{PQser:} a Matlab package for spectral seriation, Spectral properties of geometric-arithmetic index, On the lower bound of the sum of the algebraic connectivity of a graph and its complement, Nodal domains of eigenvectors for 1-Laplacian on graphs, Consensus of multi-agent systems via fully distributed event-triggered control, Optimal linear labelings and eigenvalues of graphs, Spectra, Euclidean representations and clusterings of hypergraphs, Laplace eigenvalues of graphs---a survey, Algebraic connectivity and degree sequences of trees, A tight upper bound on the spectral radius of bottleneck matrices for graphs, Largest eigenvalue of a unicyclic mixed graphs, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Boundary defensive \(k\)-alliances in graphs, Spectra of generalized compositions of graphs and hierarchical networks, Spectral clustering with physical intuition on spring-mass dynamics, Spectral methods for graph clustering - a survey, A tearing-based hybrid parallel sparse linear system solver, A spectral approach to the Randić index, Algebraic connectivity of interdependent networks, The algebraic connectivity of graphs under perturbation, A note on Fiedler vectors interpreted as graph realizations, A game of alignment: collective behavior of multi-species, A conjecture on the algebraic connectivity of connected graphs with fixed girth, On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian, On the global offensive alliance number of a graph, Offensive \(r\)-alliances in graphs, Discovering bands from graphs, A tearing-based hybrid parallel banded linear system solver, Evaluating performance of image segmentation criteria and techniques, Laplacian eigenvalues and partition problems in hypergraphs, First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph, Perron value and moment of rooted trees, Defensive \(k\)-alliances in graphs, Spectral clustering revisited: information hidden in the Fiedler vector, Solution of flow problems using unstructured grids on distributed memory platforms, Laplacian graph eigenvectors, Laplacian matrices of graphs: A survey, The effect on the Laplacian spectral radius of a graph by adding or grafting edges, Determinantal polynomials of a weighted shift matrix with palindromic geometric weights, Constructions for type I trees with nonisomorphic Perron branches, Different central parts of trees and their pairwise distances, Trace optimization and eigenproblems in dimension reduction methods, Minimum supports of eigenfunctions of graphs: a survey, Nonsingular mixed graphs with few eigenvalues greater than two, Unnamed Item, The algebraic connectivity of graphs with given circumference, Bounds on the bisection width for random \(d\)-regular graphs, 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, Improvements on Spectral Bisection, An upper bound on the algebraic connectivity of outerplanar graphs, Rotor-angle versus voltage instability in the third-order model for synchronous generators, Higher-order spectral clustering for geometric graphs, Universal completability, least eigenvalue frameworks, and vector colorings, A spectral bound for graph irregularity, A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph, Symmetric matrices, signed graphs, and nodal domain theorems, Fully distributed event-triggered consensus for a class of second-order nonlinear multi-agent systems, Schur reduction of trees and extremal entries of the Fiedler vector, On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs, The seriation problem in the presence of a double Fiedler value, The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning, Spectrum of Graphs over Rings: A Survey, Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm, Unnamed Item, On the minimum bisection of random 3-regular graphs, Many nodal domains in random regular graphs, Combinatorial Fiedler theory and graph partition, Spectral complexity of directed graphs and application to structural decomposition, Universal Features for High-Dimensional Learning and Inference, Bifurcations in Nagumo equations on graphs and Fiedler vectors, A family of gradient methods using Householder transformation with application to hypergraph partitioning, Nodal domain theorems for \(p\)-Laplacians on signed graphs, Graphs of given order and size and minimum algebraic connectivity, Perturbation of Fiedler vector: interest for graph measures and shape analysis, CDSC: causal decomposition based on spectral clustering, About the type of broom trees, Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties, 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 characteristic set, centroid, and centre for a tree, Network Essence: PageRank Completion and Centrality-Conforming Markov Chains, On the sign patterns of the smallest signless Laplacian eigenvector, Effective Resistance Preserving Directed Graph Symmetrization, Spectral bisection of graphs and connectedness, An exact approach for the multi-constraint graph partitioning problem, Decentralized mining social network communities with agents, Unnamed Item, Connectivity and eigenvalues of graphs with given girth or clique number, Minimizing algebraic connectivity over graphs made with some given blocks, Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number, Edge-matching graph contractions and their interlacing properties, State-of-the-Art Sparse Direct Solvers, Fractional diffusion on circulant networks: emergence of a dynamical small world, Ordering trees by algebraic connectivity, 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, Ordering trees and graphs with few cycles by algebraic connectivity, The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices, Laplace spectra of orgraphs and their applications, Unnamed Item, Vertex-connectivity and eigenvalues of graphs, Multilevel hybrid spectral element ordering algorithms, Combinatorial Aspects in Sparse Elimination Methods, Discrete nodal domain theorems, Invertibility of graph translation and support of Laplacian Fiedler vectors, Semidefinite spectral clustering, Hamiltonian graphs of given order and minimum algebraic connectivity, On eigenvectors of mixed graphs with exactly one nonsingular cycle, Bounds on the subdominant eigenvalue involving group inverse with applications to graphs, On a bound on algebraic connectivity: the case of equality, Natural Preconditioning and Iterative Methods for Saddle Point Systems, Unnamed Item, A doubly nonnegative relaxation for modularity density maximization, Parametric controllability of the personalized PageRank: Classic model vs biplex approach, A decentralized algorithm for spectral analysis, 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, Clustering based on eigenvectors of the adjacency matrix, Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations, Algebraic connectivity on a subclass of caterpillars, The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector, The permanent of the Laplacian matrix of a bipartite graph, Hierarchical graph Laplacian eigen transforms, Algebraic connectivity of k-connected graphs, Consensus and synchronization problems on small-world networks, Unnamed Item, Partitions of networks that are robust to vertex permutation dynamics, Fiedler vectors with unbalanced sign patterns, Global offensive alliances in graphs
Cites Work
