𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the reciprocal degree distance of graphs

✍ Scribed by Hongbo Hua; Shenggui Zhang

Book ID
113564748
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
240 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the degree distance of a graph
On the degree distance of a graph
✍ P. Dankelmann; I. Gutman; S. Mukwembi; H.C. Swart πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 373 KB
On the rotation distance of graphs
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

On the editing distance of graphs
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 graph of large distances
On the graph of large distances
✍ P. ErdΕ‘s; L. LovΓ‘sz; K. Vesztergombi πŸ“‚ Article πŸ“… 1989 πŸ› Springer 🌐 English βš– 516 KB