The diameter of directed graphs
Copyright policy )The diameter of directed graphs
Let \(D\) be a strongly connected Eulerian oriented graph with \(n\) vertices and minimum out-degree \(\delta\). The author shows that the diameter of \(D\) is at most \(4n/(2\delta+ 1)+ 2\). This bound, which strengthens an earlier bound by \textit{A. V. Knyazev} [Mat. Zametki 41, 829--843, 891 (1987; Zbl 0698.05045)], is sharp apart from an additive constant.
- University of KwaZulu-Natal South Africa
Eulerian and Hamiltonian graphs, Distance in graphs, Distance, Directed graph, Directed graphs (digraphs), tournaments, Theoretical Computer Science, Diameter, Computational Theory and Mathematics, Minimum degree, Discrete Mathematics and Combinatorics, Eulerian, Oriented graph
Eulerian and Hamiltonian graphs, Distance in graphs, Distance, Directed graph, Directed graphs (digraphs), tournaments, Theoretical Computer Science, Diameter, Computational Theory and Mathematics, Minimum degree, Discrete Mathematics and Combinatorics, Eulerian, Oriented graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!