Research Article
Hamiltonian Laceability in Line Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 98 - Issue 12 |
| Published: July 2014 |
| Authors: Manjunath. G, Murali. R, Girisha. A |
10.5120/17235-7563
|
Manjunath. G, Murali. R, Girisha. A . Hamiltonian Laceability in Line Graphs. International Journal of Computer Applications. 98, 12 (July 2014), 17-25. DOI=10.5120/17235-7563
@article{ 10.5120/17235-7563,
author = { Manjunath. G,Murali. R,Girisha. A },
title = { Hamiltonian Laceability in Line Graphs },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 98 },
number = { 12 },
pages = { 17-25 },
doi = { 10.5120/17235-7563 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A Manjunath. G
%A Murali. R
%A Girisha. A
%T Hamiltonian Laceability in Line Graphs%T
%J International Journal of Computer Applications
%V 98
%N 12
%P 17-25
%R 10.5120/17235-7563
%I Foundation of Computer Science (FCS), NY, USA
Abstract
A Connected graph G is a Hamiltonian laceable if there exists in G a Hamiltonian path between every pair of vertices in G at an odd distance. G is a Hamiltonian-t-Laceable (Hamiltonian-t*-Laceable) if there exists in G a Hamiltonian path between every pair (at least one pair) of vertices at distance't' in G. 1? t ? diamG. In this paper we explore the Hamiltonian-t*-laceability number of graph L (G) i. e. , Line Graph of G and also explore Hamiltonian-t*-Laceable of Line Graphs of Sunlet graph, Helm graph and Gear graph for t=1,2 and 3.
References
- Chartrand, H. Hevia, E. B. M. Schultz,Subgraph distance graphs defined by Edge transfers, Discrete math. 170(1997)63-79.
- Bayindureng Wu, Jixiang Meng, Hamiltonian Jump graphs, Discrete Mathematics 289(2004)95-106.
- Leena N. shenoy and R. Murali, Laceability on a class of Regular Graphs, International Journal of computational Science and Mathematics, volume2, Number 3 (2010), pp 397- 406.
- Girisha. A and R. Murali, Hamiltonian laceability in a class of 4-Regular Graphs, IOSR Journal of Mathematics, Volume 4, Issue 1 (Nov. - Dec. 2012), pp 07-12. .
- G. Manjunath and R. Murali, Hamiltonian Laceability in the Brick Product C(2n+1,1,r) Advances in Applied Mathematical Biosciences. ISSN2248-9983,Volume5,Number1(2014), pp. 13-32.
- G. Manjunath, R. Murali and S. K. Rajendra, Laceability in the Modified Brick Product of Odd Cycles, International Journal of Graph Theory, Accepted.
- G. Manjunath and R. Murali, Hamiltonian-t*-Laceability, International Organization of Scientific Research (IOSR), ISSN: 2278-3008, p-ISSN: 2319-7676. Volume 10, Issue 3 Ver. III (May –Jun. 2014), PP 55-63.
Index Terms
Keywords