Eigenvectors of acyclic matrices

From MaRDI portal
Revision as of 06:12, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4088941

DOI10.21136/cmj.1975.101356zbMath0325.15014OpenAlexW1528970839MaRDI QIDQ4088941

Miroslav Fiedler

Publication date: 1975

Full work available at URL: https://eudml.org/doc/12899




Related Items (62)

Spectral shift via ``lateral perturbationGraph Laplacians, nodal domains, and hyperplane arrangementsAn estimate for the nonstochastic eigenvalues of doubly stochastic matricesExtremal Halin graphs with respect to the signless Laplacian spectraAnomalous nodal count and singularities in the dispersion relation of honeycomb graphsAn efficient communications strategy for finite element methods on the Connection Machine CM-5 systemRecursive spectral algorithms for automatic domain partitioning in parallel finite element analysisOn trees with exactly one characteristic elementSpectral partitioning works: planar graphs and finite element meshesOn the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graphOld and new results on algebraic connectivity of graphsUnnamed ItemThe nodal count {0,1,2,3,…} implies the graph is a treeAcyclic matrices with a small number of distinct eigenvaluesSymmetric matrices, signed graphs, and nodal domain theoremsMultiplicity of  the second‐largest eigenvalue of a planar graphOn the distance Laplacian spectra of graphsNull decomposition of treesUnnamed ItemOn the signless Laplacian index of cacti with a given number of pendant verticesNodal domain theorems for \(p\)-Laplacians on signed graphsThe least eigenvalue of the signless Laplacian of the complements of treesNodal domain count for the generalized graph \(p\)-LaplacianSparks of symmetric matrices and their graphsSome bounds on the largest eigenvalues of graphsNull vectors, Schur complements, and Parter verticesOn graphs with algebraic connectivity equal to minimum edge densityOn spectral integral variations of mixed graphsPermanental polynomials of graphsOn the signless Laplacian index of unicyclic graphs with fixed diameterThe effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edgesThe second largest eigenvalue of a treeOn Fiedler- and Parter-vertices of acyclic matricesSpectral bisection of graphs and connectednessOrdering trees with nearly perfect matchings by algebraic connectivityCharacterizing graphs with maximal Laplacian Estrada indexOn the geometry and Laplacian of a graphMetric uniformization and spectral bounds for graphsOn the signless Laplacian spectra of \(k\)-treesModeling of industrial problems on high-performance polyprocessor computing systemsOrdering trees with algebraic connectivity and diameterSome inverse problems for acyclic matricesThe effect on the algebraic connectivity of a tree by grafting or collapsing of edgesA lower bound for nodal count on discrete and metric graphsTree decomposition by eigenvectorsThe spectral radius of submatrices of Laplacian matrices for graphs with cut verticesA survey of automated conjectures in spectral graph theoryFactoring matrices with a tree-structured sparsity patternSome results on the bounds of signless Laplacian eigenvaluesDiscrete nodal domain theoremsMaximal P-sets of matrices whose graph is a treeSmith normal form and acyclic matricesThe signless Laplacian spectral radius of graphs with given number of pendant verticesMinimum-rank matrices with prescribed graphThe spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vectorThe second least eigenvalue of the signless Laplacian of the complements of treesNEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHSEstimating modes of a complex dynamical network from impulse response data: Structural and graph‐theoretic characterizationsNull space structure of tree-patterned matricesFiedler vector analysis for particular cases of connected graphsA discrete nodal domain theorem for treesLaplacian matrices of graphs: A survey




Cites Work




This page was built for publication: Eigenvectors of acyclic matrices