A Wiener-type graph invariant for some bipartite graphs (Q1904516): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4692391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3807048 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the sum of all distances in a graph or digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the average distance of an interval graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mean distance in a tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4852914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4186365 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5753988 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3788039 / rank | |||
Normal rank |
Revision as of 08:58, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Wiener-type graph invariant for some bipartite graphs |
scientific article |
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