Scholarlink

<p>Among the various ideas in graph theory, labelling of graphs has diverse applications in cryptography, coding theory, data security, telecommunication networks, etc. Labeling of a graph is any mapping that, under specific circumstances, converts a given collection of graph components to a given set of numbers. In this paper, we determine the exact value of reflexive edge irregularity strength of the barycentric subdivision of circulant graphs <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(C_{p}[1,k_1]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>C</mi> <mi>p</mi> </msub> <mrow> <mo stretchy="false">[</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>k</mi> <mn>1</mn> </msub> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

On the reflexive edge irregularity strength in barycentric subdivision of circulant networks

  • 期刊论文

  • 发表日期：

    2026年5月4日

查看全文
  • Tanveer Iqbal,
  • Shajar Abbas,
  • Nashwan Adnan Othman,
  • Muhammad Zeeshan Shah,
  • Hammad Saleh M Alotaibi,
  • Mamurakhon Toshpulatova,
  • Hakim AL Garalleh,
  • Ibrahim Mahariq

摘要

Among the various ideas in graph theory, labelling of graphs has diverse applications in cryptography, coding theory, data security, telecommunication networks, etc. Labeling of a graph is any mapping that, under specific circumstances, converts a given collection of graph components to a given set of numbers. In this paper, we determine the exact value of reflexive edge irregularity strength of the barycentric subdivision of circulant graphs \(C_{p}[1,k_1]\) C p [ 1 , k 1 ] .