A Wiener-type graph invariant for some bipartite graphs (Q1904516)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 828425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Wiener-type graph invariant for some bipartite graphs |
scientific article; zbMATH DE number 828425 |
Statements
A Wiener-type graph invariant for some bipartite graphs (English)
0 references
20 December 1995
0 references
The Wiener number (index) of a connected graph \(G\) is the sum \(W(G)\) of distances between all pairs of vertices of \(G\). In this paper, a similar invariant is considered: the sum \(W^*(G)\) of the products \(n_u(e)n_v(e)\) over all edges \(e= (u, v)\), where \(n_u(e)\) is the number of vertices of \(G\) lying closer to \(u\) than to \(v\). A class of bipartite graphs is shown to have the same property for \(W\) and \(W^*\).
0 references
Wiener number
0 references
distances
0 references
bipartite graphs
0 references
0.9429095
0 references
0.9297392
0 references
0.9163346
0 references
0.9136664
0 references
