<p>The Seidel energy of a simple and undirected graph <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\Gamma\)</EquationSource> </InlineEquation>, denoted by <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(SE(\Gamma )\)</EquationSource> </InlineEquation>, is the sum of the absolute values of the eigenvalues of the Seidel matrix <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(S(\Gamma )\)</EquationSource> </InlineEquation> of <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\Gamma\)</EquationSource> </InlineEquation>. The Seidel energy is a valuable tool for analyzing the structural properties of networks. This paper investigates how this energy changes when the topology of a graph is locally perturbed by embedding a new edge. We focus on the tripartite Turán graph <i>T</i>(<i>n</i>,&#xa0;3), a model of extremal network connectivity. When an edge <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(e=u_1u_2\)</EquationSource> </InlineEquation> is embedded in the tripartite Turán graph <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(T(8,3)\cong K_{\{u_1,u_2\},\{v_1,v_2,v_3\},\{w_1,w_2,w_3\}}\)</EquationSource> </InlineEquation>, then <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(SE(T(8,3)+e)\approx 16.9282 &lt; SE(T(8,3))\approx 17.2111\)</EquationSource> </InlineEquation>. It is proved that except for <i>T</i>(8,&#xa0;3), the Seidel energy of the tripartite Turán graph <i>T</i>(<i>n</i>,&#xa0;3) with order at least 8 is always increased when an edge is embedded. This result has implications for dynamically understanding the sensitivity and stability of network descriptors.</p>

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

On the change of Seidel energy of the tripartite Turán graph T(n, 3) by an edge embedding

  • Masood Ur Rehman,
  • Muhammad Ajmal,
  • Gaixiang Cai

摘要

The Seidel energy of a simple and undirected graph \(\Gamma\) , denoted by \(SE(\Gamma )\) , is the sum of the absolute values of the eigenvalues of the Seidel matrix \(S(\Gamma )\) of \(\Gamma\) . The Seidel energy is a valuable tool for analyzing the structural properties of networks. This paper investigates how this energy changes when the topology of a graph is locally perturbed by embedding a new edge. We focus on the tripartite Turán graph T(n, 3), a model of extremal network connectivity. When an edge \(e=u_1u_2\) is embedded in the tripartite Turán graph \(T(8,3)\cong K_{\{u_1,u_2\},\{v_1,v_2,v_3\},\{w_1,w_2,w_3\}}\) , then \(SE(T(8,3)+e)\approx 16.9282 < SE(T(8,3))\approx 17.2111\) . It is proved that except for T(8, 3), the Seidel energy of the tripartite Turán graph T(n, 3) with order at least 8 is always increased when an edge is embedded. This result has implications for dynamically understanding the sensitivity and stability of network descriptors.