<?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">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.29235/1561-2430-2020-56-3-310-317</article-id><article-id custom-type="elpub" pub-id-type="custom">vestifm-534</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>Analogue of Brauer’s conjecture for the signless Laplacian of cographs</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><bio xml:lang="ru"><p>Бенедиктович Владимир Иванович – кандидат физико-математических наук, ведущий научный сотрудник</p><p>ул. Сурганова, 11, 220072, г. Минск </p></bio><bio xml:lang="en"><p>Vladimir I. Benediktovich – Ph. D. (Physics and Mathematics), Leading Researcher</p><p>Surganov Str., 11, 220072, Minsk</p></bio><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>2020</year></pub-date><pub-date pub-type="epub"><day>18</day><month>10</month><year>2020</year></pub-date><volume>56</volume><issue>3</issue><fpage>310</fpage><lpage>317</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Бенедиктович В.И., 2020</copyright-statement><copyright-year>2020</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://vestifm.belnauka.by/jour/article/view/534">https://vestifm.belnauka.by/jour/article/view/534</self-uri><abstract><p>Рассматривается класс кографов и его подклассы: пороговые графы и анти-регулярные графы. В 2011 г. Х. Бай подтвердил гипотезу Гроне – Меррис о сумме первых k собственных значений лапласиана произвольного графа. Как вариант указанной гипотезы А. Брауэр выдвинул свою гипотезу о верхней оценке этой суммы, которая хотя и была подтверждена для многих классов графов, однако по-прежнему остается открытой. По аналогии с гипотезой Брауэра в 2013 г. Ф. Ашрафом и другими была предложена гипотеза для суммы k собственных значений беззнакового лапласиана, которая также была впоследствии подтверждена для некоторых классов графов, но остается открытой. В настоящей работе для рассматриваемых нами классов графов подтверждается аналог гипотезы Брауэра для собственных значений их беззнакового лапласиана при некоторых натуральных значениях k, не превосходящих порядка рассматриваемых графов.</p></abstract><trans-abstract xml:lang="en"><p>In this paper, we consider the class of cographs and its subclasses, namely, threshold graphs and anti-regular graphs. In 2011 H. Bai confirmed the Grone – Merris conjecture about the sum of the first k eigenvalues of the Laplacian of an arbitrary graph. As a variation of the Grone – Merris conjecture, A. Brouwer put forward his conjecture about an upper bound for this sum. Although the latter conjecture was confirmed for many graph classes, however, it remains open. By analogy to Brouwer’s conjecture, in 2013 F. Ashraf et al. put forward a conjecture about the sum of k eigenvalues of the signless Laplacian, which was also confirmed for some graph classes but remains open. In this paper, an analogue of the Brouwer’s conjecture is confirmed for the graph classes under our consideration for the eigenvalues of their signless Laplacian for some natural k which does not exceed the order of the considered graphs.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>кограф</kwd><kwd>пороговый граф</kwd><kwd>анти-регулярный граф</kwd><kwd>матрица смежности</kwd><kwd>лапласиан</kwd><kwd>беззнаковый лапласиан</kwd><kwd>спектры матрицы</kwd></kwd-group><kwd-group xml:lang="en"><kwd>cograph</kwd><kwd>threshold graph</kwd><kwd>anti-regular graph</kwd><kwd>adjacency matrix</kwd><kwd>Laplacian</kwd><kwd>signless Laplacian</kwd><kwd>spectra of matrix</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена при финансовой поддержке Института математики Национальной академии наук Беларуси в рамках Государственной программы фундаментальных исследований «Конвергенция» и Белорусского республиканского фонда фундаментальных исследований (проект № Ф20УКА-005).</funding-statement><funding-statement xml:lang="en">This work was funded by the Institute of Mathematics of the National Academy of Sciences of the Republic of Belarus within the framework of “Convergence” State Program for Fundamental Research and the Belarusian Republican Foundation for Fundamental Research (project no. Ф20УКА-005).</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Hua Bai. Grone-Merris Conjecture / Hua Bai // Trans. Amer. Math. Soc. – 2011. – Vol. 363, № 8. – P. 4463–4474. https://doi.org/10.1090/s0002-9947-2011-05393-6</mixed-citation><mixed-citation xml:lang="en">Bai H. Grone-Merris Conjecture. Transactions of the American Mathematical Society, 2011, vol. 363, no. 8, pp. 4463–4474. https://doi.org/10.1090/s0002-9947-2011-05393-6</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Grone, R. The Laplacian Spectrum of a Graph II / R. Grone, R. Merris // SIAM J. Discr. Math. – 1994. – Vol. 7, № 2. – P. 221–229. https://doi.org/10.1137/s0895480191222653</mixed-citation><mixed-citation xml:lang="en">Grone R., Merris R. The Laplacian Spectrum of a Graph II. SIAM Journal on Discrete Mathematics, 1994, vol. 7, no. 2, pp. 221–229. https://doi.org/10.1137/s0895480191222653</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Brouwer, A. E. Spectra of Graphs / A. E. Brouwer, W. H. Haemers. – New York: Springer, 2012. – 250 р. https://doi.org/10.1007/978-1-4614-1939-6</mixed-citation><mixed-citation xml:lang="en">Brouwer A. E., Haemers W. H. Spectra of Graphs. New York, Springer, 2012. 250 p. https://doi.org/10.1007/978-1-4614-1939-6</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ashraf, F. On the sum of signless Laplacian eigenvalues of a graph / F. Ashraf, G. R. Omidi, B. Tayfeh-Rezaie // Linear Algebra Appl. – 2013. – Vol. 438, № 11. – P. 4539–4546. https://doi.org/10.1016/j.laa.2013.01.023</mixed-citation><mixed-citation xml:lang="en">Ashraf F., Omidi G. R., Tayfeh-Rezaie B. On the sum of signless Laplacian eigenvalues of a graph. Linear Algebra and its Applications, 2013, vol. 438, no. 11, pp. 4539–4546. https://doi.org/10.1016/j.laa.2013.01.023</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Chvátal, V. Set-packing and threshold graphs. Technical Report Rep., CORR 73–21 / V. Chvátal, P. L. Hammer; Comp. Sci. Dept. Univ. of Waterloo. – Ontario, 1973.</mixed-citation><mixed-citation xml:lang="en">Chvátal V., Hammer P. L. Set-packing and threshold graphs. Technical Report Rep., CORR 73–21. Ontario, 1973.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Jieshan Yang. On a conjecture for the signless Laplacian eigenvalues / Jieshan Yang, Lihua You // Linear Algebra Appl. – 2014. – Vol. 446. – P. 115–132. https://doi.org/10.1016/j.laa.2013.12.032</mixed-citation><mixed-citation xml:lang="en">Yang, J., You L. On a conjecture for the signless Laplacian eigenvalues. Linear Algebra and its Applications, 2014, vol. 446, pp. 115–132. https://doi.org/10.1016/j.laa.2013.12.032</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>
