<p>In this article, we comprehensively examine the number of cycles, characteristic polynomial, spectrum, and energy attributes associated with the order-inverse digraph of the cyclic group <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_786_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Z}_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">Z</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>. We aim to understand how these graph-theoretical properties are influenced by the inherent structure of the group <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_786_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {Z}_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">Z</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>. We establish characterizations for unilaterally connected, complete, and bipartite graphs, among others, and develop formulas for the number of edges, independence number, clique number, and energy.</p>

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

Graph-theoretical properties driven by the structure of the group \(\mathbb {Z}_n\): an investigation into order-inverse digraphs

  • Jimly Manuel,
  • Bindhu K. Thomas

摘要

In this article, we comprehensively examine the number of cycles, characteristic polynomial, spectrum, and energy attributes associated with the order-inverse digraph of the cyclic group \(\mathbb {Z}_n\) Z n . We aim to understand how these graph-theoretical properties are influenced by the inherent structure of the group \(\mathbb {Z}_n\) Z n . We establish characterizations for unilaterally connected, complete, and bipartite graphs, among others, and develop formulas for the number of edges, independence number, clique number, and energy.