Wiener number of vertex-weighted graphs and a chemical application
✍ Scribed by Sandi Klavžar; Ivan Gutman
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 573 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
The Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of G. If (G,w) is a vertex-weighted graph, then the Wiener number W(G,w) of (G, w) is the sum, over all pairs of vertices, of products of weights of the vertices and their distance. For G being a partial binary Hamming graph, a formula is given for computing W(G, w) in terms of a binary Hamming labeling of G. This result is applied to prove that W(PH) = W(E) + 36W(ID), where PH is a phenylene, E a pertinently vertex-weighted hexagonal squeeze of PH, and ID the inner dual of the hexagonal squeeze.
📜 SIMILAR VOLUMES
The graph-theory derived model for the bonding topology in the globally delocalized polyhedral boranes B6H;-and Bl2H1:-is evaluated by comparison of the energies of the core molecular orbitals with those obtained by the 1962 LCAO-MO extended Hiickel calculations of Hoffmann and Lipscomb. Of particul
## Abstract A method is described for isolating intact, individual skeletal muscle fibers from glutaraldehyde fixed muscle. This method was conceived to eliminate the many limitations of determining muscle nuclear numbers in histological cross section. Glutaraldehyde fixed fibers are isolated by di