<p>For a graph <i>G</i> with adjacency matrix <i>A</i>(<i>G</i>), the splitting field <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathbb {F}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="double-struck">F</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is defined as the splitting field over <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb {Q}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="double-struck">Q</mi> </math></EquationSource> </InlineEquation> of the characteristic polynomial <i>f</i>(<i>x</i>) of <i>A</i>(<i>G</i>). The extension degree <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\([\mathbb {F}:\mathbb {Q}]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">[</mo> <mi mathvariant="double-struck">F</mi> <mo>:</mo> <mi mathvariant="double-struck">Q</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> is termed the algebraic degree of <i>G</i> and denoted <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\deg (G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>deg</mo> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. A graph <i>G</i> satisfying <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\textrm{deg}(G)=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>deg</mtext> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> is called an integral graph. Investigating the algebraic degrees of graphs thus generalizes the study of integral graphs. To establish foundational results in this area, for fundamental classes of trees, we derive explicit formulas for <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\textrm{deg}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>deg</mtext> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and characterize their splitting field. Surprisingly, the algebraic degrees of infinite families of trees are determined by solutions to Pell equations, exposing a profound number-theoretic structure intrinsic to graph spectra. This work provides a new paradigm for classifying graphs via field extensions.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Splitting fields of trees

  • Weijun Liu,
  • Lu Lu,
  • Rongrong Lu

摘要

For a graph G with adjacency matrix A(G), the splitting field \(\mathbb {F}(G)\) F ( G ) is defined as the splitting field over \(\mathbb {Q}\) Q of the characteristic polynomial f(x) of A(G). The extension degree \([\mathbb {F}:\mathbb {Q}]\) [ F : Q ] is termed the algebraic degree of G and denoted \(\deg (G)\) deg ( G ) . A graph G satisfying \(\textrm{deg}(G)=1\) deg ( G ) = 1 is called an integral graph. Investigating the algebraic degrees of graphs thus generalizes the study of integral graphs. To establish foundational results in this area, for fundamental classes of trees, we derive explicit formulas for \(\textrm{deg}(G)\) deg ( G ) and characterize their splitting field. Surprisingly, the algebraic degrees of infinite families of trees are determined by solutions to Pell equations, exposing a profound number-theoretic structure intrinsic to graph spectra. This work provides a new paradigm for classifying graphs via field extensions.