✦ LIBER ✦

On the sum of all distances in composite graphs

✍ Scribed by Yeong-Nan Yeh; Ivan Gutman

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 357 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0092-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the sum of all distances in a graph o

On the sum of all distances in a graph or digraph

✍ Ján Plesník 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 870 KB

The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only

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 the rotation distance of graphs

✍ R.J. Faudree; R.H. Schelp; L. Lesniak; A. Gyárfás; J. Lehel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Let (x,y) be an edge of a graph G. Then the rotation of (x, y) about x is the operation of removing (x, y) from G and inserting (x, y') as an edge, where y' is a vertex of G. The rotation distance between graphs G and H is the minimum number of rotations necessary to transform G into H. Lower and up

Realization of digraphs by preferences b

Realization of digraphs by preferences based on distances in graphs

✍ Weizhen Gu; K. B. Reid; Walter Schnyder 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

On mean distance in certain classes of g

On mean distance in certain classes of graphs

✍ George R. T. Hendry 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB 👁 1 views

On the distance matrix of a directed gra

On the distance matrix of a directed graph

✍ R. L. Graham; A. J. Hoffman; H. Hosoya 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _