Distance matrix and Laplacian of a tree with attached graphs

19Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

A tree with attached graphs is a tree, together with graphs defined on its partite sets. We introduce the notion of incidence matrix, Laplacian and distance matrix for a tree with attached graphs. Formulas are obtained for the minors of the incidence matrix and the Laplacian, and for the inverse and the determinant of the distance matrix. The case when the attached graphs themselves are trees is studied more closely. Several known results, including the Matrix Tree theorem, are special cases when the tree is a star. The case when the attached graphs are paths is also of interest since it is related to the transportation problem. © 2004 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Bapat, R. B. (2005). Distance matrix and Laplacian of a tree with attached graphs. Linear Algebra and Its Applications, 411(1–3), 295–308. https://doi.org/10.1016/j.laa.2004.06.017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free