Araştırma Makalesi
BibTex RIS Kaynak Göster

Yıl 2018, Cilt: 1 Sayı: 2, 191 - 193, 25.12.2018

Rao Li Anuj Daga Vivek Gupta Manad Mishra Spandan Kumar Sahu Ayush Sinha

https://doi.org/10.33401/fujma.450809

Öz

Kaynakça

  • [1] Zh. G. Nikoghosyan, A size bound for Hamilton cycles, (2011), arXiv:1107.2201 [math.CO].
  • [2] J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.
  • [3] Zh. G. Nikoghosyan, Two sufficient conditions for Hamilton and dominating cycles, Int. J. Math. Math. Sci., 2012 (2012), Article ID 185346, 25 pages, doi:10.1155/2012/185346.
  • [4] K. Zhao, Dirac type condition and Hamiltonian graphs, Serdica Math. J. 37 (2011), 277–282.
  • [5] D. W. Cranston, S. O, Hamiltonicity in connected regular graphs, Inform. Process. Lett., 113 (2013), 858–860.

Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Yıl 2018, Cilt: 1 Sayı: 2, 191 - 193, 25.12.2018

Rao Li Anuj Daga Vivek Gupta Manad Mishra Spandan Kumar Sahu Ayush Sinha

https://doi.org/10.33401/fujma.450809

Öz

A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. In this note, we present sufficient conditions involving minimum degree and size for Hamiltonian and traceable graphs. One of the sufficient conditions strengthens the result obtained by Nikoghosyan in [1].

Anahtar Kelimeler

Hamiltonian graph Minimum degree Traceable graph

Kaynakça

  • [1] Zh. G. Nikoghosyan, A size bound for Hamilton cycles, (2011), arXiv:1107.2201 [math.CO].
  • [2] J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York, 1976.
  • [3] Zh. G. Nikoghosyan, Two sufficient conditions for Hamilton and dominating cycles, Int. J. Math. Math. Sci., 2012 (2012), Article ID 185346, 25 pages, doi:10.1155/2012/185346.
  • [4] K. Zhao, Dirac type condition and Hamiltonian graphs, Serdica Math. J. 37 (2011), 277–282.
  • [5] D. W. Cranston, S. O, Hamiltonicity in connected regular graphs, Inform. Process. Lett., 113 (2013), 858–860.
Toplam 5 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Matematik
Bölüm Makaleler
Yazarlar

Rao Li

Anuj Daga Bu kişi benim

Vivek Gupta Bu kişi benim

Manad Mishra Bu kişi benim

Spandan Kumar Sahu Bu kişi benim

Ayush Sinha Bu kişi benim

Yayımlanma Tarihi 25 Aralık 2018
Gönderilme Tarihi 3 Ağustos 2018
Kabul Tarihi 7 Kasım 2018
Yayımlandığı Sayı Yıl 2018 Cilt: 1 Sayı: 2

Kaynak Göster

APA Li, R., Daga, A., Gupta, V., Mishra, M., vd. (2018). Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs. Fundamental Journal of Mathematics and Applications, 1(2), 191-193. https://doi.org/10.33401/fujma.450809
AMA Li R, Daga A, Gupta V, Mishra M, Sahu SK, Sinha A. Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs. FUJMA. Aralık 2018;1(2):191-193. doi:10.33401/fujma.450809
Chicago Li, Rao, Anuj Daga, Vivek Gupta, Manad Mishra, Spandan Kumar Sahu, ve Ayush Sinha. “Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs”. Fundamental Journal of Mathematics and Applications 1, sy. 2 (Aralık 2018): 191-93. https://doi.org/10.33401/fujma.450809.
EndNote Li R, Daga A, Gupta V, Mishra M, Sahu SK, Sinha A (01 Aralık 2018) Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs. Fundamental Journal of Mathematics and Applications 1 2 191–193.
IEEE R. Li, A. Daga, V. Gupta, M. Mishra, S. K. Sahu, ve A. Sinha, “Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs”, FUJMA, c. 1, sy. 2, ss. 191–193, 2018, doi: 10.33401/fujma.450809.
ISNAD Li, Rao vd. “Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs”. Fundamental Journal of Mathematics and Applications 1/2 (Aralık 2018), 191-193. https://doi.org/10.33401/fujma.450809.
JAMA Li R, Daga A, Gupta V, Mishra M, Sahu SK, Sinha A. Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs. FUJMA. 2018;1:191–193.
MLA Li, Rao vd. “Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs”. Fundamental Journal of Mathematics and Applications, c. 1, sy. 2, 2018, ss. 191-3, doi:10.33401/fujma.450809.
Vancouver Li R, Daga A, Gupta V, Mishra M, Sahu SK, Sinha A. Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs. FUJMA. 2018;1(2):191-3.
 Kapak Resmi İndir

Creative Commons License
The published articles in Fundamental Journal of Mathematics and Applications are licensed under a