✦ LIBER ✦

On mean distance in certain classes of graphs

✍ Scribed by George R. T. Hendry

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 332 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence of graphs with prescribed mean

Existence of graphs with prescribed mean distance

✍ G. R. T. Hendry 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

On the editing distance of graphs

✍ Maria Axenovich; André Kézdy; Ryan Martin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

## Abstract An edge‐operation on a graph __G__ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from __G__ to $\cal G$ is the smallest number of edge‐operations needed to modify __G__ into a graph

On certain Hamiltonian cycles in planar

On certain Hamiltonian cycles in planar graphs

✍ B�hme, T.; Harant, J.; Tk�?, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

On the structure of hereditary classes o

On the structure of hereditary classes of graphs

✍ Edward R. Scheinerman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

A class of graphs is hereditary if it is closed under taking induced subgraphs. Classes associated with graph representations have "composition sequences" and we show that this concept is equivalent to a notion of "amalgamation" which generalizes disjoint union of graphs. We also discuss how general

A Note on Distance Approximating Trees i

A Note on Distance Approximating Trees in Graphs

✍ Victor Chepoi; Feodor Dragan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Jump-number of Means on Graphs

✍ Christian Delhommé; Maurice Pouzet; Norbert Sauer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We prove that the jump-number of a symmetric and idempotent n-ary operation defined on the vertex-set of a graph G is at least min g 4 , g-1 n , where g is the girth of G.