Publication:
On planarity of 3-jump graphs

0
0

Issued Date

2016

Resource Type

Article

File Type

application/pdf

ISSN

13118080

DOI

10.12732/ijpam.v108i2.18

Other identifier(s)

2-s2.0-84976370556

Rights Holder(s)

มหาวิทยาลัยศรีนครินทรวิโรฒ

Bibliographic Citation

International Journal of Pure and Applied Mathematics. Vol 108, No.2 (2016), p.451-466

Suggested Citation

Khemmani V., Lumduanhom C., Muangloy S., Muanphet M., Tipnuch K. On planarity of 3-jump graphs. International Journal of Pure and Applied Mathematics. Vol 108, No.2 (2016), p.451-466. doi:10.12732/ijpam.v108i2.18 Retrieved from: https://hdl.handle.net/20.500.14740/5779

Title

On planarity of 3-jump graphs

Author(s)

Khemmani V.
 Lumduanhom C.
 Muangloy S.
 Muanphet M.
 Tipnuch K.

Abstract

For a graph G of size m ≥ 1 and edge-induced subgraphs F and H of size k where 1 ≤ k ≤ m, the subgraph H is said to be obtained from the subgraph F by an edge jump if there exist four distinct vertices u, v, w and x such that uv ∈ E(F), wx ∈ E(G) - E(F), and H = F - uv + wx. The k-jump graph Jk(G) is that graph whose vertices correspond to the edge-induced subgraphs of size k of G where two vertices F and H of Jk(G) are adjacent if and only if H can be obtained from F by an edge jump. All connected graphs G for whose J3(G) is planar are determined. © 2016 Academic Publications, Ltd.

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/5779

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By