International Journal of Computational and Applied Mathematics

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Cyclic Hamiltonian Graphs


Affiliations
1 Dept. of Mathematics, Yellamma Dasappa Institute of Technology, Kanakapura Road, Raghuvanahalli, Bangalore-560062, Karnataka, India
     

   Subscribe/Renew Journal


A graph G is K-cyclic Hamiltonian or simply a cyclic Hamiltonian graph if there exists kD, the set of all distances of G, such that D(G, {k}) is Hamiltonian. A uu-path of length n is a cycle, denoted by C<SUB>n</SUB>. A Cycle of a graph G containing all the vertices of G, if it exists, is called a Hamiltonian Cycle of G. Certainly the Hamiltonian cycle is the cycle of largest length in a graph. The graph possessing a Hamilton cycle is called Hamiltonian

Keywords

Cyclic Hamiltonian, Hamiltonian Cycle, Hamiltonian
Subscription Login to verify subscription
User
Notifications
Font Size


  • Alspach, B. and T.D. Parsons, On Hamiltonian cycles in Matacirculant graphs, Annals of Discrete Math., 15:1–7, 1982.

  • Buckley, F., F. Harary, Distance in Graphs, Addison-Wesley, 1990.

  • Claude Berge, The Theory of Graphs, Dover Publications, Inc. Newyork, 2001.

  • Fleischner, H., The Square of every two connected graph is Hamiltonian, J. Combin.Theory, 16B:29–34, 1974.

  • Harary, F., Graph theory, Narosa/AddisonWesley, 1969.

  • Hartsfield Gerhard, Ringel, Pearls in Graph Theory, Academic press, USA,1994.

  • Myers, B. R., Hamiltonian factorisation of the product of complete graphs withitself, Networks, 2:1–9, 1972.

  • Puttaraju, C., and B. Sooryanarayana, Hamiltonian Distance Generating sets of an Abelian Group, Proceedings, National Seminar on Recent developments in applications of Mathematics held at Sri Padmavathi Mahila University, Tirupati, Andhra Pradesh, India, during 21-22, March 2005.

  • Puttaraju, C., and B. Sooryanarayana., Hamiltonian Distance Generating sets of an Abelian Group, Far East Journal of Appl. Math., 22(2):201–213, 2006.

  • Puttaraju, C., and B. Sooryanarayana, Hamiltonian Distance Generating sets, Decompositions and Cayley graphs, proceedings, National Seminar on Graph Theory & its Applications, held at St Aloysius College, Mangalore, Karnataka, India, during 4-6, January 2007.

  • Puttaraju C., Hamiltonian Distance Generating Sets of Graphs and Groups, Ph.D Thesis (2008), Visvesvaraya Technological University, Belgaum.

  • Puttaraju C and B.Sooryanarayana, Hamilton Distance Sets of a Path, International Journal of Computational and Applied Mathematics, volume5, number5(2010), pp.637-647.

  • Risha, S.,A new proof of the theorem of Fleishner, J. Combin. Theory, 3:201– 214, 1990.

  • Arthur T. White, Graphs, Groups and Surfaces, Elsevier Publ.Co.,NewYork,1973.


Abstract Views: 371

PDF Views: 0




  • Cyclic Hamiltonian Graphs

Abstract Views: 371  |  PDF Views: 0

Authors

C. Puttaraju
Dept. of Mathematics, Yellamma Dasappa Institute of Technology, Kanakapura Road, Raghuvanahalli, Bangalore-560062, Karnataka, India

Abstract


A graph G is K-cyclic Hamiltonian or simply a cyclic Hamiltonian graph if there exists kD, the set of all distances of G, such that D(G, {k}) is Hamiltonian. A uu-path of length n is a cycle, denoted by C<SUB>n</SUB>. A Cycle of a graph G containing all the vertices of G, if it exists, is called a Hamiltonian Cycle of G. Certainly the Hamiltonian cycle is the cycle of largest length in a graph. The graph possessing a Hamilton cycle is called Hamiltonian

Keywords


Cyclic Hamiltonian, Hamiltonian Cycle, Hamiltonian

References