Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2025, Volume 31, Number 1, Pages 228–235
DOI: https://doi.org/10.21538/0134-4889-2025-31-1-228-235
(Mi timm2165)
 

Infinite locally finite connected graphs with countable complements in $\mathbb{C}$ of the sets of eigenvalues

V. I. Trofimovab

a N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
References:
Abstract: In a previous paper, the author proved that non-eigenvalues of the adjacency operator of an infinite locally finite connected graph over a field of characteristic 0 can be only algebraic over the prime subfield of the field elements (in particular, only algebraic numbers when the field is $\mathbb{C}$). There were also given examples of infinite locally finite connected graphs for which certain algebraic numbers are not eigenvalues of their adjacency operators over $\mathbb{C}$. In the present paper we give examples of infinite locally finite connected graphs for each of which infiniely many algebraic numbers are not eigenvalues of its adjacency operator over $\mathbb{C}$. More exactly, for every prime integer $p$, we construct an infinite locally finite connected graph such that no positive integer multiple of $p$ is an eigenvalue of the adjacency operator over $\mathbb{C}$ of the graph. In addition, in the paper a necessary condition (based on results of the mentioned previous paper) is given for an algebraic number not to be an eigenvalue of the adjacency operator over $\mathbb{C}$ of at least one infinite locally finite connected graph.
Keywords: locally finite graph, adjacency matrix, eigenvalue.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation FUMF-2022-0003
The work was supported under state a contract of IMM UB RAS, project no. FUMF-2022-0003.
Received: 07.11.2024
Revised: 14.11.2024
Accepted: 18.11.2024
Bibliographic databases:
Document Type: Article
UDC: 512.542+519.175.1
MSC: 05C63, 05C50
Language: Russian
Citation: V. I. Trofimov, “Infinite locally finite connected graphs with countable complements in $\mathbb{C}$ of the sets of eigenvalues”, Trudy Inst. Mat. i Mekh. UrO RAN, 31, no. 1, 2025, 228–235
Citation in format AMSBIB
\Bibitem{Tro25}
\by V.~I.~Trofimov
\paper Infinite locally finite connected graphs with countable complements in $\mathbb{C}$ of the sets of eigenvalues
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2025
\vol 31
\issue 1
\pages 228--235
\mathnet{http://mi.mathnet.ru/timm2165}
\crossref{https://doi.org/10.21538/0134-4889-2025-31-1-228-235}
\elib{https://elibrary.ru/item.asp?id=80441894}
\edn{https://elibrary.ru/hzldlz}
Linking options:
  • https://www.mathnet.ru/eng/timm2165
  • https://www.mathnet.ru/eng/timm/v31/i1/p228
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:106
    Full-text PDF :3
    References:11
    First page:6
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025