<p>A new sub-family of Hypercubes called the <i>associated Mersenne graphs</i> <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2936_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="31" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {M}}_{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="script">M</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> are introduced in this paper. The definition of associated Mersenne graphs is motivated from the Fibonacci-run graphs (Ö. Eǧecioǧlu, V. Iršič, 2021) by extending run-constrained strings to circularly-run-constrained strings. The name of this new family of graphs is identified with the interesting fact that <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="373_2025_2936_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="69" /> </InlineMediaObject> <EquationSource Format="TEX">\(|V({\mathcal {M}}_{n})|\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">|</mo> <mi>V</mi> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">M</mi> <mi>n</mi> </msub> <mo stretchy="false">)</mo> <mo stretchy="false">|</mo> </mrow> </math></EquationSource> </InlineEquation> is equal to the <i>n</i>-th associated Mersenne number. Various interesting structural and enumerative properties of associated Mersenne graphs are investigated, including the analogue of the fundamental recursion, numbers of vertices and edges, radius, diameter, center, periphery and medianicity. Some future research directions and open problems concerning associated Mersenne graphs are also proposed.</p>

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

Associated Mersenne Graphs

  • Jianxin Wei,
  • Yujun Yang

摘要

A new sub-family of Hypercubes called the associated Mersenne graphs \({\mathcal {M}}_{n}\) M n are introduced in this paper. The definition of associated Mersenne graphs is motivated from the Fibonacci-run graphs (Ö. Eǧecioǧlu, V. Iršič, 2021) by extending run-constrained strings to circularly-run-constrained strings. The name of this new family of graphs is identified with the interesting fact that \(|V({\mathcal {M}}_{n})|\) | V ( M n ) | is equal to the n-th associated Mersenne number. Various interesting structural and enumerative properties of associated Mersenne graphs are investigated, including the analogue of the fundamental recursion, numbers of vertices and edges, radius, diameter, center, periphery and medianicity. Some future research directions and open problems concerning associated Mersenne graphs are also proposed.