<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">dan</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады Национальной академии наук Беларуси</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady of the National Academy of Sciences of Belarus</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-8323</issn><issn pub-type="epub">2524-2431</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">dan-351</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICS</subject></subj-group></article-categories><title-group><article-title>СПЕКТРАЛЬНЫЙ РАДИУС И ГАМИЛЬТОНОВОСТЬ ГРАФА</article-title><trans-title-group xml:lang="en"><trans-title>SPECTRAL RADIUS AND HAMILTONICITY OF A GRAPH</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>БЕНЕДИКТОВИЧ</surname><given-names>В. И.</given-names></name><name name-style="western" xml:lang="en"><surname>BENEDIKTOVICH</surname><given-names>V. I.</given-names></name></name-alternatives><email xlink:type="simple">vbened@im.bas-net.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Институт математики НАН Беларуси</institution></aff><aff xml:lang="en"><institution>Institute of Mathematics of the National Academy of Sciences of Belarus</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2016</year></pub-date><pub-date pub-type="epub"><day>01</day><month>11</month><year>2016</year></pub-date><volume>60</volume><issue>5</issue><fpage>46</fpage><lpage>53</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; БЕНЕДИКТОВИЧ В.И., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">БЕНЕДИКТОВИЧ В.И.</copyright-holder><copyright-holder xml:lang="en">BENEDIKTOVICH V.I.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.belnauka.by/jour/article/view/351">https://doklady.belnauka.by/jour/article/view/351</self-uri><abstract><p>В данной работе в два раза уменьшена нижняя граница порядка графов, полученная В. Никифоровым, для которых выполняется обобщение достаточного спектрального признака гамильтоновости графа, предложенного ранее.</p></abstract><trans-abstract xml:lang="en"><p>In this article, the lower graph order boundary obtained by V. Nikiforov, for which the generalization of the sufficient spectral criterion of Hamiltonicity of a graph is valid, has been reduced twice.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>матрица смежности</kwd><kwd>спектральный радиус</kwd><kwd>гамильтонов цикл</kwd><kwd>минимальная степень</kwd><kwd>индуцированный подграф</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Adjacency matrix</kwd><kwd>spectral radius</kwd><kwd>Hamiltonian cycle</kwd><kwd>minimum degree</kwd><kwd>induced subgraph</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Ore, O. Arc coverings of graphs / O. Ore // Ann. Mat. Pura Appl. – 1961. – Vol. 55. – P. 315–321.</mixed-citation><mixed-citation xml:lang="en">Ore, O. Arc coverings of graphs / O. Ore // Ann. Mat. Pura Appl. – 1961. – Vol. 55. – P. 315–321.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ore, O. Hamilton-connected graphs / O. Ore // J. Math. Pures Appl. – 1963. – Vol. 42. – P. 21– 27.</mixed-citation><mixed-citation xml:lang="en">Ore, O. Hamilton-connected graphs / O. Ore // J. Math. Pures Appl. – 1963. – Vol. 42. – P. 21– 27.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Bondy, A. A method in graph theory / A. Bondy, V. Chvátal // Discrete Math. – 1976. – Vol. 15. – P. 111–135.</mixed-citation><mixed-citation xml:lang="en">Bondy, A. A method in graph theory / A. Bondy, V. Chvátal // Discrete Math. – 1976. – Vol. 15. – P. 111–135.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Brualdi, R. A. On the spectral radius of complementary acyclic matrices of zeros and ones / R. A. Brualdi, E. S. Solheid // SIAM J. Algebraic Discrete Methods. – 1986. – Vol. 7, N 2. – P. 265–272.</mixed-citation><mixed-citation xml:lang="en">Brualdi, R. A. On the spectral radius of complementary acyclic matrices of zeros and ones / R. A. Brualdi, E. S. Solheid // SIAM J. Algebraic Discrete Methods. – 1986. – Vol. 7, N 2. – P. 265–272.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Бенедиктович, В. И. Достаточное спектральное условие гамильтоновости графа / В. И. Бенедиктович // Докл. НАН Беларуси. – 2015. – Т. 59, № 5. – С. 5–12.</mixed-citation><mixed-citation xml:lang="en">Бенедиктович, В. И. Достаточное спектральное условие гамильтоновости графа / В. И. Бенедиктович // Докл. НАН Беларуси. – 2015. – Т. 59, № 5. – С. 5–12.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Nikiforov, V. Spectral radius and Hamiltonicity of graphs with large minimum degree / V. Nikiforov // arXiv:1602.01033 [math.CO] – http://arxiv.org/abs/1602.01033. – 2016.</mixed-citation><mixed-citation xml:lang="en">Nikiforov, V. Spectral radius and Hamiltonicity of graphs with large minimum degree / V. Nikiforov // arXiv:1602.01033 [math.CO] – http://arxiv.org/abs/1602.01033. – 2016.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kelmans, A. K. On graphs with randomly deleted edges / A. K. Kelmans // Acta Math. Acad. Sci. Hung. – 1981. – Vol. 37. – P. 77–88.</mixed-citation><mixed-citation xml:lang="en">Kelmans, A. K. On graphs with randomly deleted edges / A. K. Kelmans // Acta Math. Acad. Sci. Hung. – 1981. – Vol. 37. – P. 77–88.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Csikvari, P. On a conjecture of V. Nikiforov / P. Csikvari // Discrete Math. – 2009. – Vol. 309, N 13. – P. 4522–4526.</mixed-citation><mixed-citation xml:lang="en">Csikvari, P. On a conjecture of V. Nikiforov / P. Csikvari // Discrete Math. – 2009. – Vol. 309, N 13. – P. 4522–4526.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Brouwer, A. E. Spectra of graphs / A. E. Brouwer, W. H. Haemers. – Springer-Verlag, 2011.</mixed-citation><mixed-citation xml:lang="en">Brouwer, A. E. Spectra of graphs / A. E. Brouwer, W. H. Haemers. – Springer-Verlag, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Godsil, C. D. Algebraic graph theory / C. D. Godsil, G. F. Royle. – Springer-Verlag, 2001.</mixed-citation><mixed-citation xml:lang="en">Godsil, C. D. Algebraic graph theory / C. D. Godsil, G. F. Royle. – Springer-Verlag, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Прасолов, В. В. Многочлены / В. В. Прасолов. – М.: МЦНМО, 2001.</mixed-citation><mixed-citation xml:lang="en">Прасолов, В. В. Многочлены / В. В. Прасолов. – М.: МЦНМО, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Chvátal, V. On Hamiltons ideals / V. Chvátal // J. Combin. Theory Ser. B. – 1972. – Vol. 12. – P. 163–168.</mixed-citation><mixed-citation xml:lang="en">Chvátal, V. On Hamiltons ideals / V. Chvátal // J. Combin. Theory Ser. B. – 1972. – Vol. 12. – P. 163–168.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Hong, Y. A sharp upper bound of the spectral radius of graphs / Y. Hong, J. Shu, K. Fang // J. Combin. Theory. – 2001. – Vol. 81. – P. 177–183.</mixed-citation><mixed-citation xml:lang="en">Hong, Y. A sharp upper bound of the spectral radius of graphs / Y. Hong, J. Shu, K. Fang // J. Combin. Theory. – 2001. – Vol. 81. – P. 177–183.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
