𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characteristic Polynomials of Weighted Lattices

✍ Scribed by G. Whittle

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
958 KB
Volume
99
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
✍ Haruo Hosoya; K. Balasubramanian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

Polynomial identities from weighted latt
Polynomial identities from weighted lattice path counting
✍ Şerban N. BuzeΕ£eanu; Virgil Domocoş πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 154 KB

We give bijective proofs, using weighted lattice paths, of two multinomial identities concerning the generalized h-factorial polynomials of order n. [x]~, := The first-one is the multinomial identity of order s verified by these polynomials. Using this identity (and its proof) as a lemma, we deriv

Computer generation of characteristic po
Computer generation of characteristic polynomials of edge-weighted graphs, heterographs, and directed graphs
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 624 KB

The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s