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

Abstract Let $$G_S$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> </mml:math> be a graph with loops attached at each vertex in $$S \subseteq V(G).$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>S</mml:mi> <mml:mo>⊆</mml:mo> <mml:mi>V</mml:mi> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> <mml:mo>.</mml:mo> </mml:mrow> </mml:math> In this article, we develop exact formulae for the number of closed 3- and 4-walks on $$G_S$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> </mml:math> in terms of vertex degrees and certain elementary subgraphs of $$G_S.$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>.</mml:mo> </mml:mrow> </mml:math> 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,$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>,</mml:mo> </mml:mrow> </mml:math> 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,$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>M</mml:mi> <mml:mi>q</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>=</mml:mo> <mml:msubsup> <mml:mo>∑</mml:mo> <mml:mrow> <mml:mi>i</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:mi>n</mml:mi> </mml:msubsup> <mml:msup> <mml:mrow> <mml:mo>|</mml:mo> <mml:msub> <mml:mi>λ</mml:mi> <mml:mi>i</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>-</mml:mo> <mml:mfrac> <mml:mi>σ</mml:mi> <mml:mi>n</mml:mi> </mml:mfrac> <mml:mo>|</mml:mo> </mml:mrow> <mml:mi>q</mml:mi> </mml:msup> <mml:mo>,</mml:mo> </mml:mrow> </mml:math> twisted by the spectral moment $$\textsf{M}_1(G_S)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> for $$G_S,$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>,</mml:mo> </mml:mrow> </mml:math> 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 . $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mfrac> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>0</mml:mn> </mml:msub> </mml:mfrac> <mml:mo>≤</mml:mo> <mml:mfrac> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mfrac> <mml:mo>≤</mml:mo> <mml:mfrac> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>3</mm

Authors

Institutions

Publication Details

Journal
Bulletin of the Malaysian Mathematical Sciences Society
Published
2025-09-29
DOI
https://doi.org/10.1007/s40840-025-01971-w
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Johnny Lim
Bulletin of the Malaysian Mathematical Sciences Society
Graph theory and applications
article

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

Johnny Lim
article en

Abstract

Abstract Let $$G_S$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> </mml:math> be a graph with loops attached at each vertex in $$S \subseteq V(G).$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>S</mml:mi> <mml:mo>⊆</mml:mo> <mml:mi>V</mml:mi> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> <mml:mo>.</mml:mo> </mml:mrow> </mml:math> In this article, we develop exact formulae for the number of closed 3- and 4-walks on $$G_S$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> </mml:math> in terms of vertex degrees and certain elementary subgraphs of $$G_S.$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>.</mml:mo> </mml:mrow> </mml:math> 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,$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>,</mml:mo> </mml:mrow> </mml:math> 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,$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>M</mml:mi> <mml:mi>q</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>=</mml:mo> <mml:msubsup> <mml:mo>∑</mml:mo> <mml:mrow> <mml:mi>i</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:mi>n</mml:mi> </mml:msubsup> <mml:msup> <mml:mrow> <mml:mo>|</mml:mo> <mml:msub> <mml:mi>λ</mml:mi> <mml:mi>i</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>-</mml:mo> <mml:mfrac> <mml:mi>σ</mml:mi> <mml:mi>n</mml:mi> </mml:mfrac> <mml:mo>|</mml:mo> </mml:mrow> <mml:mi>q</mml:mi> </mml:msup> <mml:mo>,</mml:mo> </mml:mrow> </mml:math> twisted by the spectral moment $$\textsf{M}_1(G_S)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> for $$G_S,$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>G</mml:mi> <mml:mi>S</mml:mi> </mml:msub> <mml:mo>,</mml:mo> </mml:mrow> </mml:math> 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 . $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mfrac> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>0</mml:mn> </mml:msub> </mml:mfrac> <mml:mo>≤</mml:mo> <mml:mfrac> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mfrac> <mml:mo>≤</mml:mo> <mml:mfrac> <mml:msub> <mml:mi>M</mml:mi> <mml:mn>3</mm

Bulletin of the Malaysian Mathematical Sciences SocietyVol. 48(6)
Universiti Sains Malaysia (MY)
Openalex Percentile: Top 68%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.