The edge-Wiener index of a graph (Q1025981): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2008.09.040 / rank | |||
Property / author | |||
Property / author: Peter Dankelmann / rank | |||
Property / author | |||
Property / author: Ivan Gutman / rank | |||
Property / author | |||
Property / author: Simon Mukwembi / rank | |||
Property / author | |||
Property / author: Henda C. Swart / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q106065264 / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Peter Dankelmann / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Ivan Gutman / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Simon Mukwembi / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Henda C. Swart / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.09.040 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2143401511 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3947691 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Wiener index of trees: Theory and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Wiener index of hexagonal systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5714889 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Wiener index for graphs and their line graphs with arbitrary large cyclomatic numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4351067 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some new results on distance-based graph invariants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4261184 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2008.09.040 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:33, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The edge-Wiener index of a graph |
scientific article |
Statements
The edge-Wiener index of a graph (English)
0 references
23 June 2009
0 references
The Wiener index \(W(G)\) of a (connected) graph \(G\) is the sum of distances between all pairs of vertices in \(G\). The edge-Wiener index \(W_e(G)\) of \(G\) is the Wiener index of its line graph \(L(G)\), i.e., \(W_e(G)=W(L(G))\). The authors give bounds on \(W_e(G)\) in terms of order and size of \(G\). In particular, they prove that \(W_e(G)\leq \frac{2^2}{5^5} n^5 +O(n^{9/2})\) for all graphs \(G\) of order \(n\) and that the coefficient of \(n^5\) in this upper bound is best possible.
0 references
Distance
0 references
Wiener index
0 references
line graph
0 references