상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
학술저널

HAMILTONIAN INSERTED GRAPHS AND SQUARES

  • 0
136700.jpg

In this paper we characterize the graphs whose inserted graphs are Hamiltonian, and we study the relationship between Hamiltonian graphs and inserted graphs. Also we prove that if a connected graph G contains at least 3 vertices then inserted graph of the square of G is Hamiltonian and if G contains at least 3 edges then the square of inserted graph of G is Hamiltonian.

1. Introduction

2. Preliminaries

3. Hamiltonian I(G)

4. Hamiltonian I(G 2 ) and [I(G)] 2

(0)

(0)

로딩중