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

Submit your paper
Know more
The week's pick
Responsive image
A Hybrid Transformer-CNN Framework with Early and Late Fusion for Robust Skin Lesion Classification

Raihan Tanvir
Random Articles
Reseach Article

A Result on Line Graphs and Hamiltonian Graphs

by S.venu Madhava Sarma, T.ravi Kumar, T.v.pradeep Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 119 - Number 4
Year of Publication: 2015
Authors: S.venu Madhava Sarma, T.ravi Kumar, T.v.pradeep Kumar
10.5120/21055-3703

S.venu Madhava Sarma, T.ravi Kumar, T.v.pradeep Kumar . A Result on Line Graphs and Hamiltonian Graphs. International Journal of Computer Applications. 119, 4 ( June 2015), 16-19. DOI=10.5120/21055-3703

@article{ 10.5120/21055-3703,
author = { S.venu Madhava Sarma, T.ravi Kumar, T.v.pradeep Kumar },
title = { A Result on Line Graphs and Hamiltonian Graphs },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 119 },
number = { 4 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume119/number4/21055-3703/ },
doi = { 10.5120/21055-3703 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:03:09.316637+05:30
%A S.venu Madhava Sarma
%A T.ravi Kumar
%A T.v.pradeep Kumar
%T A Result on Line Graphs and Hamiltonian Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 119
%N 4
%P 16-19
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In 1856, Hamiltonian introduced the Hamiltonian Graph where a Graph which is covered all the vertices without repetition and end with starting vertex. In this Paper I would like to prove that If 'G' is a Complete and locally Complete graph, on n ? 3 vertices, which does not contain an induced K1,3, then G is Hamiltonian.

References
  1. Bondy J. A. and V. Chvátal, A Method in Graph Theory, Discr. Math. 15 1976), pp 111-136.
  2. Dirac G. A. , Some Theorems on Abstract Graphs, Proc. Lond. Math. Soc. 2 (1952), pp 69-81.
  3. Garey M. R and D. S. Jhonson, Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman and Company, New York.
  4. O. Ore, Note on Hamiltonian Circuits, Am. Mat. Monthly 67 (1960), pp 55.
  5. West D. B, Introduction to Graph Theory, Prentice-Hall, Inc. , New Jersey.
  6. Williams – Nash, C. St. J. A. "Hamiltonian Arcs and Circuits" in recent trends in graph theory ed. By M. Capobianco et al. , Springer – verlag, Berlin, 1971.
  7. V. Chvatal "New directions in Hamiltonian Graph theory" In New directions in graph theory ed. By F. Harary, Academic press, N. Y. London, 1973.
  8. Venu Madhava Sarma. S and T. V. Pradeep Kumar International Journal of Mathematical Archive-2(12), 2011,Page 2538-2542.
  9. Venu Madhava Sarma. S International Journal of Computer Application, Issue 2, Volume 1(February 2012) , Page 21-31.
  10. Venu Madhava Sarma. S and T. V. Pradeep Kumar International J. of Math. Sci. & Engg. Appls. (IJMSEA) ISSN 0973-9424, Vol. 6 No. III (May, 2012), pp. 47-54.
  11. Venu Madhava Sarma. S and T. V. Pradeep Kumar proceedings of Two Day UGC National seminar on "Modern Trends in Mathematics and Physical Sciences ( NSMTMPS – 2012) dated 20th , 21st Jan, 2012.
  12. D. P. Geller, The square root of a digraph, J. Combinatorial Theory, 5 (1968), 320-321.
  13. F. Harary, Graph Theory , Addison-Wesley, Reading, Mass. , 1969.
  14. A. Mukhopadhyay, The square root of a graph, J. Combinatorial Theory, 2 (1967), 290-295.
Index Terms

Computer Science
Information Sciences

Keywords

Graph Hamiltonian Graph Complete Graph Neighborhood Locally Complete Graph.

Powered by PhDFocusTM