CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Hamiltonian Laceability in Line Graphs

by Manjunath. G, Murali. R, Girisha. A
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 98 - Number 12
Year of Publication: 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 },
issue_date = { July 2014 },
volume = { 98 },
number = { 12 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 17-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume98/number12/17235-7563/ },
doi = { 10.5120/17235-7563 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:26:01.534990+05:30
%A Manjunath. G
%A Murali. R
%A Girisha. A
%T Hamiltonian Laceability in Line Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 98
%N 12
%P 17-25
%D 2014
%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
  1. Chartrand, H. Hevia, E. B. M. Schultz,Subgraph distance graphs defined by Edge transfers, Discrete math. 170(1997)63-79.
  2. Bayindureng Wu, Jixiang Meng, Hamiltonian Jump graphs, Discrete Mathematics 289(2004)95-106.
  3. 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.
  4. 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. .
  5. 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.
  6. G. Manjunath, R. Murali and S. K. Rajendra, Laceability in the Modified Brick Product of Odd Cycles, International Journal of Graph Theory, Accepted.
  7. 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

Computer Science
Information Sciences

Keywords

Connected graph Line graph Sun let graph Helm graph Wheel graph Gear graph and Hamiltonian-t-laceable graph.

Powered by PhDFocusTM