On the graceful numbering of spanning trees
β Scribed by I. Cahit; R. Cahit
- Book ID
- 113161813
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 911 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta
## Abstract The theorem of Gutman et al. (1983) is applied to calculate the number of spanning trees in the carbonβcarbon connectivityβnetwork of the recently diagnosed C~60~βcluster buckminsterfullerene. This βcomplexityβ turns out to be approximately 3.75 Γ 10^20^ and it is found necessary to inv
In this and subsequent articles, we intend to explore Rosa's conjecture that every tree is graceful [l]. We define the concept of joint sum of graceful trees and study its operational properties. We shall prove the gracefulness of a certain family of trees. ## Keywords-tisak conjecture, Graceful
A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.