<p>Topological descriptors play a crucial role in various scientific fields, particularly in analyzing the physico-chemical and thermodynamic properties of chemical compounds. Recently, a new topological descriptor, known as the Trinajstić descriptor, has been introduced. For a simple connected graph <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\( G \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>G</mi> </math></EquationSource> </InlineEquation>, the Trinajstić descriptor is defined as <Equation ID="Equ14"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_Equ14.gif" Format="GIF" Height="29" Rendition="HTML" Resolution="72" Type="Linedraw" Width="316" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} NT(G)= \sum (n(x)-n(y))^2 \ \ \ \forall x,y \in V(G) \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>N</mi> <mi>T</mi> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mo>∑</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>-</mo> <mi>n</mi> <mrow> <mo stretchy="false">(</mo> <mi>y</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mn>2</mn> </msup> <mspace width="4pt" /> <mspace width="4pt" /> <mspace width="4pt" /> <mo>∀</mo> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>∈</mo> <mi>V</mi> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>Where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="34" /> </InlineMediaObject> <EquationSource Format="TEX">\( n(x) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is the number of vertices whose distance is lesser to <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq3.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( x \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>x</mi> </math></EquationSource> </InlineEquation> than <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq4.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( y \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>y</mi> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\( n(y) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo stretchy="false">(</mo> <mi>y</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> is the number of vertices whose distance is lesser to <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq4.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( y \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>y</mi> </math></EquationSource> </InlineEquation> than <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13370_2025_1314_Article_IEq3.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\( x \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>x</mi> </math></EquationSource> </InlineEquation>. In this article, we calculate the Trinajstić descriptor for the Kite graph, Fan graph, and Helm graph, expanding its applicability to these graph structures.</p>

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

On the Trinajstic Descriptor of some graphs

  • Hafiz M. Fraz,
  • Kashif Ali,
  • Farhana Yasmeen,
  • Muhammad Aamer Rashid,
  • Muhammad Farhan Hanif

摘要

Topological descriptors play a crucial role in various scientific fields, particularly in analyzing the physico-chemical and thermodynamic properties of chemical compounds. Recently, a new topological descriptor, known as the Trinajstić descriptor, has been introduced. For a simple connected graph \( G \) G , the Trinajstić descriptor is defined as \(\begin{aligned} NT(G)= \sum (n(x)-n(y))^2 \ \ \ \forall x,y \in V(G) \end{aligned}\) N T ( G ) = ( n ( x ) - n ( y ) ) 2 x , y V ( G ) Where \( n(x) \) n ( x ) is the number of vertices whose distance is lesser to \( x \) x than \( y \) y and \( n(y) \) n ( y ) is the number of vertices whose distance is lesser to \( y \) y than \( x \) x . In this article, we calculate the Trinajstić descriptor for the Kite graph, Fan graph, and Helm graph, expanding its applicability to these graph structures.