<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_S\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>G</mi> <mi>S</mi> </msub> </math></EquationSource> </InlineEquation> be a graph with loops attached at each vertex in <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="TEX">\(S \subseteq V(G).\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <mo>⊆</mo> <mi>V</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> In this article, we develop exact formulae for the number of closed 3- and 4-walks on <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="24" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_S\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>G</mi> <mi>S</mi> </msub> </math></EquationSource> </InlineEquation> in terms of vertex degrees and certain elementary subgraphs of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_S.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> We then derive the specific closed walks formulae for several graph families such as complete bipartite self-loop graphs, complete graphs, cycle graphs, etc. We demonstrate that such invariants are non-trivial in <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_S,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> which otherwise may be trivial in the loopless case. Moreover, we study a moment-like quantity <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq6.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="224" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {M}_q(G_S)=\sum ^n_{i=1} |\lambda _i(G_S) - \frac{\sigma }{n}|^q,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">M</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msubsup> <mo>∑</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msup> <mrow> <mo stretchy="false">|</mo> <msub> <mi>λ</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mfrac> <mi>σ</mi> <mi>n</mi> </mfrac> <mo stretchy="false">|</mo> </mrow> <mi>q</mi> </msup> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> twisted by the spectral moment <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq7.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="56" /> </InlineMediaObject> <EquationSource Format="TEX">\(\textsf{M}_1(G_S)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="sans-serif">M</mi> <mn>1</mn> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_S,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> and show a positivity result. We also establish that the following ratio inequality holds: <Equation ID="Equ37"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_Equ37.gif" Format="GIF" Height="41" Rendition="HTML" Resolution="72" Type="Linedraw" Width="353" /> </MediaObject> <EquationSource Format="TEX">\( \frac{\mathcal {M}_{1}}{\mathcal {M}_{0}} \le \frac{\mathcal {M}_{2}}{\mathcal {M}_{1}} \le \frac{\mathcal {M}_{3}}{\mathcal {M}_{2}} \le \frac{\mathcal {M}_{4}}{\mathcal {M}_{3}} \le \cdots \le \frac{\mathcal {M}_{n}}{\mathcal {M}_{n-1}} \le \cdots . \)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mfrac> <msub> <mi mathvariant="script">M</mi> <mn>1</mn> </msub> <msub> <mi mathvariant="script">M</mi> <mn>0</mn> </msub> </mfrac> <mo>≤</mo> <mfrac> <msub> <mi mathvariant="script">M</mi> <mn>2</mn> </msub> <msub> <mi mathvariant="script">M</mi> <mn>1</mn> </msub> </mfrac> <mo>≤</mo> <mfrac> <msub> <mi mathvariant="script">M</mi> <mn>3</mn> </msub> <msub> <mi mathvariant="script">M</mi> <mn>2</mn> </msub> </mfrac> <mo>≤</mo> <mfrac> <msub> <mi mathvariant="script">M</mi> <mn>4</mn> </msub> <msub> <mi mathvariant="script">M</mi> <mn>3</mn> </msub> </mfrac> <mo>≤</mo> <mo>⋯</mo> <mo>≤</mo> <mfrac> <msub> <mi mathvariant="script">M</mi> <mi>n</mi> </msub> <msub> <mi mathvariant="script">M</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mfrac> <mo>≤</mo> <mo>⋯</mo> <mo>.</mo> </mrow> </math></EquationSource> </Equation>As a consequence, we obtain lower bounds for the self-loop graph energy <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq9.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {E}(G_S)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">E</mi> <mo stretchy="false">(</mo> <msub> <mi>G</mi> <mi>S</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> in terms of <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1971_Article_IEq10.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="32" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {M}_i,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">M</mi> <mi>i</mi> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> extending some classical bounds.</p>

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

Closed walks of low dimension and twisted moments on self-loop graphs

  • Johnny Lim

摘要

Let \(G_S\) G S be a graph with loops attached at each vertex in \(S \subseteq V(G).\) S V ( G ) . In this article, we develop exact formulae for the number of closed 3- and 4-walks on \(G_S\) G S in terms of vertex degrees and certain elementary subgraphs of \(G_S.\) G S . We then derive the specific closed walks formulae for several graph families such as complete bipartite self-loop graphs, complete graphs, cycle graphs, etc. We demonstrate that such invariants are non-trivial in \(G_S,\) G S , which otherwise may be trivial in the loopless case. Moreover, we study a moment-like quantity \(\mathcal {M}_q(G_S)=\sum ^n_{i=1} |\lambda _i(G_S) - \frac{\sigma }{n}|^q,\) M q ( G S ) = i = 1 n | λ i ( G S ) - σ n | q , twisted by the spectral moment \(\textsf{M}_1(G_S)\) M 1 ( G S ) for \(G_S,\) G S , and show a positivity result. We also establish that the following ratio inequality holds: \( \frac{\mathcal {M}_{1}}{\mathcal {M}_{0}} \le \frac{\mathcal {M}_{2}}{\mathcal {M}_{1}} \le \frac{\mathcal {M}_{3}}{\mathcal {M}_{2}} \le \frac{\mathcal {M}_{4}}{\mathcal {M}_{3}} \le \cdots \le \frac{\mathcal {M}_{n}}{\mathcal {M}_{n-1}} \le \cdots . \) M 1 M 0 M 2 M 1 M 3 M 2 M 4 M 3 M n M n - 1 . As a consequence, we obtain lower bounds for the self-loop graph energy \(\mathcal {E}(G_S)\) E ( G S ) in terms of \(\mathcal {M}_i,\) M i , extending some classical bounds.