✦ LIBER ✦

Fairness, distances and degrees

✍ Scribed by Philippe Darondeau; Doris Nolte; Lutz Priese; Serge Yoccoz

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 775 KB
Volume: 97
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90390-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounded degrees and prescribed distances

Bounded degrees and prescribed distances in graphs

✍ Yair Caro; Zsolt Tuza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Let X = {x1, ., x,,,} and Y= { J'~,. ,y,,\_} be two disjoint sets of vertices in a graph G. Then (X, Y) is called an antipodal set-pair ofsize m (m-ASP, for short) if the distance of xi and yj is at most two if and only if i #j. We prove that in a graph of maximum degree k every m-ASP has size m < k

Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

We prove that in a graph of order n and minimum degree d, the mean distance µ must satisfy This asymptotically confirms, and improves, a conjecture of the computer program GRAFFITI. The result is close to optimal; examples show that for any d, µ may be larger than n/(d + 1).

On reverse degree distance

✍ Bo Zhou; Nenad Trinajstić 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 141 KB

Erratum: Mean distance and minimum degre

Erratum: Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

95-99 mistakenly attributes the computer program GRAFFITI to Fajtlowitz and Waller, instead of just Fajtlowitz. (Our apologies to Siemion Fajtlowitz.) Note also that one of the ''flaws'' we note for Conjecture 62 (that it was made for graphs regular of degree d, vice graphs of minimum degree d) was

Average distance, minimum degree, and sp

Average distance, minimum degree, and spanning trees

✍ Dankelmann, Peter; Entringer, Roger 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

The average distance µ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., µ(G) = ( n 2 ) -1 {x,y}⊂V (G) d G (x, y), where V (G) denotes the vertex set of G and d G (x, y) is the distance between x and y. We prove that every connected graph

Distance degrees of vertex-transitive gr

Distance degrees of vertex-transitive graphs

✍ Teluhiko Hilano 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 230 KB