✦ LIBER ✦

Average distance and generalised packing in graphs

✍ Scribed by Peter Dankelmann

Book ID: 108114231
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 396 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.05.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average distance in colored graphs

✍ Peter Dankelmann; Wayne Goddard; Peter Slater 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract For a graph __G__ where the vertices are colored, the __colored distance__ of __G__ is defined as the sum of the distances between all unordered pairs of vertices having different colors. Then for a fixed supply __s__ of colors, __d~s~(G)__ is defined as the minimum colored distance ove

Independence and average distance in gra

Independence and average distance in graphs

✍ Peter Firby; Julie Haviland 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Average distance in graphs with removed

Average distance in graphs with removed elements

✍ D. Bienstock; E. Györi 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

Average distances in undirected graphs a

Average distances in undirected graphs and the removal of vertices

✍ Ingo Althöfer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Graph similarity and distance in graphs

✍ G. Chartrand; G. Kubicki; M. Schultz 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 427 KB

Packing and covering triangles in graphs

✍ P.E. Haxell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoint triangles is v(G), then there is a set C of edges of G of size at most (3 -e)v(G) such that E(T) N C 7~ 0 for every triangle T of G, where e> 3. This is the first nontrivial bound known for a long-standing