STM Journals Peer-reviewed research from Consortium e-Learning Network

Research & Reviews: Discrete Mathematical Structures

Laceability in Line Graphs and Jump Graphs of Petersen Graph

  1. Manjunath g
  2. Murali R

Abstract

A simple connected graph is Hamiltonian laceable if there exists a Hamiltonian path between every pair of distinct vertices at an odd distance in it. is Hamiltonian-t-laceable (t*-laceable) if there exists a Hamiltonian path in  between every pair (at least one pair) of vertices u and v in with the property  Manjunath et al. obtained Hamiltonian laceability properties in line graphs and jump graphs of some graphs. In this paper we explore laceabilty properties in Petersen graphs and also explore the laceability properties of line graphs and jump graphs [1, 2].Cite this ArticleManjunath G, Murali R. Laceability in Line Graphs and Jump Graphs of Petersen Graph. Research & Reviews: Discrete Mathematical Structures. 2016; 3(2): 5–13p.

Keywords

Support