English

The induced subgraph K_2_,_3 in a non-Hamiltonian graphs

Discrete Mathematics 2020-11-17 v2 Combinatorics

Abstract

A graph G\textit{G} is a tuple (V,E)(\textit{V}, \textit{E}), where V\textit{V} is the vertex set, E\textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree 2 on an edge except for leaving only one vertex of degree 2. We denote by I a set of cycles only jointed by inside vertices. |I| is the number of sets I in a graph. We use a norm graph to denote a reduced graph of |I|=1. g\textit{g} is a subgraph obtained by deleting all removable cycles from a basis of a norm graph. In this paper, we show that a norm graph G\textit{G} is non-Hamiltonian, if and only if, g\textit{g} and K_2_,_3 are homeomorphic.

Keywords

Cite

@article{arxiv.1906.10847,
  title  = {The induced subgraph K_2_,_3 in a non-Hamiltonian graphs},
  author = {Heping Jiang},
  journal= {arXiv preprint arXiv:1906.10847},
  year   = {2020}
}

Comments

8 pages, 4 figures