✦ LIBER ✦

Computing the average distance of an interval graph

✍ Scribed by Peter Dankelmann

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 306 KB
Volume: 48
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90174-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The average Steiner distance of a graph

✍ Dankelmann, Peter; Oellermann, Ortrud R.; Swart, Henda C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB 👁 2 views

The average distance p(G) of a graph G is the average among the distances between all pairs of vertices in G. For n 2 2, the average Steiner n-distance ,4G) of a connected graph G is the average Steiner distance over all sets of n vertices in G. It is shown that for a connected weighted graph G, pu,

Interval digraphs: An analogue of interv

Interval digraphs: An analogue of interval graphs

✍ S. Das; M. Sen; A. B. Roy; D. B. West 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Intersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uu in the intersection digraph when the "source set" of u intersects the "terminal set" of u. Every n-vertex digraph is an intersection digraph of o

Computer generation of distance polynomi

Computer generation of distance polynomials of graphs

✍ K. Balasubramanian 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB

A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. T

An evolution of interval graphs

✍ Edward R. Scheinerman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 985 KB

Every Graph Is an Integral Distance Grap

Every Graph Is an Integral Distance Graph in the Plane

✍ Hiroshi Maehara; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 290 KB

We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.

The average degree of an edge-chromatic

The average degree of an edge-chromatic critical graph II

✍ Douglas R. Woodall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract A graph __G__ with maximum degree Δ and edge chromatic number $\chi\prime({G}) > \Delta$ is __edge__‐Δ‐__critical__ if $\chi\prime{(G-e)} = \Delta$ for every edge __e__ of __G__. It is proved that the average degree of an edge‐Δ‐critical graph is at least ${2\over 3}{(\Delta+1)}$ if $\D