✦ LIBER ✦

Wiener and Hyper-Wiener Numbers in a Single Matrix

✍ Scribed by Diudea, M.V.

Book ID: 120305133
Publisher: American Chemical Society
Year: 1996
Tongue: English
Weight: 154 KB
Volume: 36
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci9501857

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Relation between W '/W Index, Hyp

On the Relation between W '/W Index, Hyper-Wiener Index, and Wiener Number

✍ Plavsic, D.; Lers, N.; Sertic-Bionda, K. 📂 Article 📅 2000 🏛 American Chemical Society 🌐 English ⚖ 41 KB

Zagreb, Harary and hyper-Wiener indices

Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number

✍ Lihua Feng; Aleksandar Ilić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Matrix Wiener–Hopf–Hilbert Factorisation

✍ Rawlins, A. D. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 692 KB

Matrix Wiener-Hopf-Hilbert Factorisation

✍ A. D. Rawlins 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 201 KB

Maximum Zagreb index, minimum hyper-Wien

Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity

✍ A. Behtoei; M. Jannesari; B. Taeri 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Wiener number of vertex-weighted graphs

Wiener number of vertex-weighted graphs and a chemical application

✍ Sandi Klavžar; Ivan Gutman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 573 KB

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