Graph properties for splitting with grounded Laplacian matrices

DOI10.1007/BF01990530zbMath0789.65021MaRDI QIDQ1314635

Ulla Miekkala

Publication date: 7 March 1994

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

linear systemsspectral radiusiterative solutionsregular splittingsiteration matrixundirected connected graphgrounded Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10)

Related Items (7)

Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks ⋮ Schur reduction of trees and extremal entries of the Fiedler vector ⋮ Random walks and diffusion on networks ⋮ Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition ⋮ Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems ⋮ Characterization of expansion-related properties of modular graphs ⋮ Cluster consensus in first and second-order continuous-time networks with input and communication delays

Cites Work

• On spectral characterization and embeddings of graphs
• Convergence of Dynamic Iteration Methods for Initial Value Problems
• The Laplacian Spectrum of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph properties for splitting with grounded Laplacian matrices