Name
Abstract | ||
|---|---|---|
For a graph G of size m⩾1 and edge-induced subgraphs F and H of size k ( 1⩽k⩽m ), the subgraph H is said to 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 minimum number of edge jumps required to transform F into H is the k -jump distance from F to H . For a graph G of size m⩾1 and an integer k with 1⩽k⩽m , the k -jump graph J k (G) is that graph whose vertices correspond to the edge-induced subgraphs of size k of G and where two vertices of J k (G) are adjacent if and only if the k -jump distance between the corresponding subgraphs is 1. All connected graphs G for which J 2 (G) is planar are determined. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00404-5 | Discrete Mathematics |
Keywords | Field | DocType |
k -jump graph,planar graph,05c12,k -jump distance,jump graph,k,connected graph | Discrete mathematics,Graph toughness,Combinatorics,Bound graph,Graph power,k-vertex-connected graph,Neighbourhood (graph theory),Graph bandwidth,Distance-regular graph,Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
220 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Héctor Hevia | 1 | 9 | 2.43 |
| Donald W. VanderJagt | 2 | 8 | 2.65 |
| Ping Zhang | 3 | 2 | 1.15 |