✦ LIBER ✦

Tree counting polynomials for labelled graphs part I: Properties

✍ Scribed by Samuel D. Bedrosian

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 753 KB
Volume: 312
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(81)90053-3

No coin nor oath required. For personal study only.

✦ Synopsis

The properties of special pairs of tree counting polynomials that relate to a class of incomplete graphs and their complements are presented. These polynomial pairs are related by the previously defined binary complementing operation. In contrast with alternative graph representations, they offer the possibility of serving as a convenient signature for the specific configurations. In Part II, a new constructive procedure is presented for deriving these polynomials. It is shown that the new algorithmic approach facilitates obtaining the polynomials for cases not readily obtained by use of generic factors of the basic subgraphs.

📜 SIMILAR VOLUMES

Some methods for counting the spanning t

Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes [Discrete Applied Mathematics 67 (1996) 51–66]

✍ T.J.N. Browna; R.B. Mallion; P. Pollak; A. Roth 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 81 KB

To recast Eq. ( ), we obtain from the same identity the relations Yij = Xj, j = 1,2, . . . , n, ' Now at St. John's College, Oxford.