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

A q-analogue of the distance matrix of a tree

โœ Scribed by R.B. Bapat; A.K. Lal; Sukanta Pati

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
189 KB
Volume
416
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Distance matrix and Laplacian of a tree
Distance matrix and Laplacian of a tree with attached graphs
โœ 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

The distance spectrum of a tree
The distance spectrum of a tree
โœ Russell Merris ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 240 KB

## Abstract Let __T__ be a tree with line graph __T__\*. Define __K__ = 2__I__ + __A__(__T__\*), where __A__ denotes the adjacency matrix. Then the eigenvalues of โ€2__K__^โˆ’1^ interlace the eigenvalues of the distance matrix __D__. This permits numerous results about the spectrum of __K__ to be tran

On the Resistance Distance of a Tree
On the Resistance Distance of a Tree
โœ H.B. Walikar; D.N. Misale; R.L. Patil; H.S. Ramane ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB
A combinatorial application of matrix Ri
A combinatorial application of matrix Riccati equations and their q-analogue
โœ G.B. Collins; J.P. Goulden; D.M. Jackson; A.M. Nierstrasz ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 737 KB

The generating functions for a large class of combinatorial problems involving the enumeration of permutations may be expressed as solutions to matrix Riccati equations. We show that the generating functions for the permutation problem in which the number of inversions is also preserved form a syste