𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge Rotation and Edge Slide Distance Graphs

✍ Scribed by E.B. Jarrett

Book ID
108458722
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
862 KB
Volume
34
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-distance-regular graphs
Edge-distance-regular graphs
✍ M. CΓ‘mara; C. DalfΓ³; J. FΓ brega; M.A. Fiol; E. Garriga πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 189 KB
Distances between graphs under edge oper
Distances between graphs under edge operations
✍ Wayne Goddard; Henda C. Swart πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 585 KB

We investigate three metrics on the isomorphism classes of graphs derived from elementary edge operations: the edge move, rotation and slide distances. We derive relations between the metrics, and bounds on the distance between arbitrary graphs and between arbitrary trees. We also consider the sensi

Properties of edge-deleted distance stab
Properties of edge-deleted distance stable graphs
✍ Klemm, Karen; Winters, Steven J. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 72 KB πŸ‘ 2 views

The distance from a vertex u to a vertex v in a connected graph G is the length of a shortest u-v path in G. The distance of a vertex v of G is the sum of the distances from v to the vertices of G. For a vertex v in a 2-edge-connected graph G, we define the edge-deleted distance of v as the maximum

Subgraph distances in graphs defined by
Subgraph distances in graphs defined by edge transfers
✍ Gary Chartrand; HΓ©ctor Hevia; Elzbieta B. Jarrett; Michelle Schultz πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 800 KB

For two edge-induced subgraphs F and H of the same size in a graph G, the subgraph H can be obtained from F by an edge jump if there exist four distinct vertices u, v, w, and x in G such that uv ~ E(F), wx ~ E(G) -E(F), and H = F -uv + wx. The subgraph F is j-transformed into H ifH can be obtained f