Open AccessNonplanarity of Iterated Line Graphs
Author(s) -
Jing Wang
Publication year - 2020
Publication title -
journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.252
H-Index - 13
eISSN - 2314-4785
pISSN - 2314-4629
DOI - 10.1155/2020/5752806
Subject(s) - mathematics , iterated function , combinatorics , graph , line graph , discrete mathematics , mathematical analysis
The 1-crossing index of a graph G is the smallest integer k such that the k th iterated line graph of G has crossing number greater than 1. In this paper, we show that the 1-crossing index of a graph is either infinite or it is at most 5. Moreover, we give a full characterization of all graphs with respect to their 1-crossing index.