HAMILTONIAN INSERTED GRAPHS AND SQUARES

Abstract

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.

This article was migrated from the previous system via automation. The abstract may not be written correctly. Please view the PDF file.