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)
Cites Work
Related Items (only showing first 100 items - show all)
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 ⋮ Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures ⋮ Combinatorial Aspects in Sparse Elimination Methods ⋮ Discrete nodal domain theorems ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ Semidefinite spectral clustering ⋮ A hybrid time/event-triggered interaction framework for multi-agent consensus with relative measurements ⋮ The algebraic connectivity of barbell graphs ⋮ 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 ⋮ Web document clustering using hyperlink structures
This page was built for publication:
