IJPAM: Volume 108, No. 2 (2016)
Sriwan Muangloy, Massiri Muanphet, Kittisak Tipnuch
Department of Mathematics
Sukhumvit 23, Bangkok, 10110, THAILAND
Abstract. For a graph of size and edge-induced subgraphs and of size where , the subgraph is said to be obtained from the subgraph by an edge jump if there exist four distinct vertices , , and such that , , and . The -jump graph is that graph whose vertices correspond to the edge-induced subgraphs of size of where two vertices and of are adjacent if and only if can be obtained from by an edge jump.
All connected graphs for whose is planar are determined.
Received: January 27, 2016
Revised: January 27, 2016
Published: October 1, 2016
AMS Subject Classification: 05C10, 05C12
Key Words and Phrases: -jump distance, -jump graph, -jump graph, planar graph
Download paper from here.
- G. Chartrand, H. Hevia, E.B. Jarrett and M. Schultz, Subgraph distance in graphs defined by edge tranfers, Discrete Math., 170 (1997), 63-79.
- G. Chartrand, L. Lesniak and P. Zhang,Graphs & Digraphs: 5th Edition,Chapman & Hall/CRC, USA (2010).
- H. Hevia, D.W. VanderJagt, and P. Zhang, On the planarity of jump graphs, Discrete Math., 220 (2000), 119-129.
- K. Kuratowski, Sur le probléme des courbes gauches en topologie, Fund. Math., 15 (1930), 270-283.
DOI: 10.12732/ijpam.v108i2.18 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 451 - 466
-JUMP GRAPHS%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.