A Fiedler center for graphs generalizing the characteristic set
From MaRDI portal
Publication:2332427
DOI10.1016/j.laa.2019.09.015zbMath1426.05089OpenAlexW2973428106WikidataQ114664034 ScholiaQ114664034MaRDI QIDQ2332427
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.09.015
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex and subharmonic functions on graphs
- Combinatorial Perron parameters for trees
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Network Properties Revealed through Matrix Functions
- Characteristic vertices of weighted trees via perron values
- Combinatorial Perron values of trees and bottleneck matrices
- Characteristic vertices of trees*
This page was built for publication: A Fiedler center for graphs generalizing the characteristic set