๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Laplacian spread of quasi-tree graphs

โœ Scribed by Ying Xu; Jixiang Meng


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
191 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Laplacian spread of unicyclic graphs
โœ Yan-Hong Bao; Ying-Ying Tan; Yi-Zheng Fan ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 477 KB
On the Laplacian spread of graphs
โœ Mingqing Zhai; Jinlong Shu; Yuan Hong ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

The Laplacian spread s(G) of a graph G is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of G. Several upper bounds of Laplacian spread and corresponding extremal graphs are obtained in this paper. Particularly, if G is a conne

Permanent of the Laplacian matrix of tre
โœ Richard A Brualdi; John L Goldwasser ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 805 KB

be the Laplacian matrix of G. When G is a tree or a bipartite graph we obtain bounds for the permanent of L(G) both in terms of n only and in terms of d 1 ..... d,. Improved bounds are obtained in terms of the diameter of T and the size of a matching in T.

Distance matrix and Laplacian of a tree
โœ R.B. Bapat ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 172 KB

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