Trees with matrix weights: Laplacian matrix and characteristic-like vertices
From MaRDI portal
Publication:2134567
DOI10.1016/j.laa.2022.03.029zbMath1487.05159arXiv2009.05996OpenAlexW3086837313MaRDI QIDQ2134567
Publication date: 3 May 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.05996
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The product distance matrix of a tree with matrix weights on its arcs
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Generalized inverses. Theory and applications.
- Distance matrices perturbed by Laplacians.
- Resistance matrices of graphs with matrix weights
- Inverses of triangular matrices and bipartite graphs
- Ordering trees with algebraic connectivity and diameter
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- Determinant of the distance matrix of a tree with matrix weights
- Characteristic vertices of weighted trees via perron values
- Maximizing the distance between center, centroid and characteristic set of a tree
- Matrix Analysis
- The vec-permutation matrix, the vec operator and Kronecker products: a review
- Algebraic connectivity of weighted trees under perturbation
- On distance and Laplacian matrices of trees with matrix weights
- On trees with maximum algebraic connectivity
- Ordering trees by algebraic connectivity
- Characteristic vertices of trees*
- Ordering trees by algebraic connectivity
This page was built for publication: Trees with matrix weights: Laplacian matrix and characteristic-like vertices