Laceability in Line Graphs and Jump Graphs of Petersen Graph

Authors

  • Manjunath g Department of Mathematics, Sri Krishna Institute of Technology, Bengaluru, Karnataka, India
  • Murali R Department of Mathematics, Sri Krishna Institute of Technology, Bengaluru, Karnataka, India

DOI:

https://doi.org/10.37591/rrdms.v3i2.808

Keywords:

Connected graph, Hamiltonian-t-laceable graphs, Hamiltonian-t*-laceable graphs, laceability number

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 Article
Manjunath G, Murali R. Laceability in Line Graphs and Jump Graphs of Petersen Graph. Research & Reviews: Discrete Mathematical Structures. 2016; 3(2): 5–13p.

Author Biography

  • Manjunath g, Department of Mathematics, Sri Krishna Institute of Technology, Bengaluru, Karnataka, India
    Mathematics

References

Manjunath G, Murali R, Girisha A. Hamiltonian Laceability in Line Graphs. International Journal of Computer Applications (IJCA) (0975-8887). Jul 2014; 98(12): 17–25p.

Manjunath G, Murali R. Hamiltonian-t*-Laceability in Jump Graphs of Diameter Two. IOSR Journal of Mathematics (IOSR JM). May–Jun 2014; 10(3) Ver III. 55–63p. e-2278-3008, p-ISSN: 2319-7676.

Behzad M. A Characterization of Total Graphs. Amer Math Soc. 1970; 26(3).

Jain Akiyama, Takashi Hamada, Yoshimura I. On Characterization of Middle Graphs. True Mathematics. 1975; 11: 35–39p.

Manjunath G, Murali R, Rajendra SK. Hamiltonian Laceability in Total Graphs. International Journal of Mathematics and Computer Research (IJMCR). Dec 2014; 2(12): 774–785p.

Manjunath G, Murali R, Shanmukha B. Hamiltonian Laceability in Middle Graphs. International Journal of Engineering Sciences & Research Technology (IJESRT). Jan 2015; 203–209p. ISSN-2277-9655.

Manjunath G, Murali R. Hamiltonian Laceability in Brick Product C(2n+1, 1, r). Advances in Applied Mathematical Biosciences (AAMB). 2014; 5(1): 13–32p. ISSN 2248-9983.

Manjunath G, Murali R, Thimmaraju SN. Hamiltonian Laceability in Modified Brick Product of Odd Cycles. International Journal of Computer Application (IJCA) (2250-1797). Apr 2015; 5(3): 117–131p.

Downloads

Published

2016-09-05

Issue

Vol. 3 No. 2 (2016)

Section

Research Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.