<p>For a digraph <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {D}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">D</mi> </math></EquationSource> </InlineEquation> with <i>n</i> vertices, <i>a</i> arcs and the outdegree sequence <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="102" /> </InlineMediaObject> <EquationSource Format="TEX">\(d_1^{+}, d_2^{+},\dots , d_n^{+}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>d</mi> <mn>1</mn> <mo>+</mo> </msubsup> <mo>,</mo> <msubsup> <mi>d</mi> <mn>2</mn> <mo>+</mo> </msubsup> <mo>,</mo> <mo>⋯</mo> <mo>,</mo> <msubsup> <mi>d</mi> <mi>n</mi> <mo>+</mo> </msubsup> </mrow> </math></EquationSource> </InlineEquation> of vertices of <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {D}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">D</mi> </math></EquationSource> </InlineEquation>. The first outdegree Zagreb index of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {D}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">D</mi> </math></EquationSource> </InlineEquation> is <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="59" /> </InlineMediaObject> <EquationSource Format="TEX">\(Zg^{+}({\mathcal {D}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>Z</mi> <msup> <mi>g</mi> <mo>+</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="script">D</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, which is defined as <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq6.gif" Format="GIF" Height="38" Rendition="HTML" Resolution="72" Type="Linedraw" Width="136" /> </InlineMediaObject> <EquationSource Format="TEX">\(Zg^{+}({\mathcal {D}})=\sum \limits _{i=1}^{n}(d_i^{+})^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>Z</mi> <msup> <mi>g</mi> <mo>+</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="script">D</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <munderover> <mo movablelimits="false">∑</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msup> <mrow> <mo stretchy="false">(</mo> <msubsup> <mi>d</mi> <mi>i</mi> <mo>+</mo> </msubsup> <mo stretchy="false">)</mo> </mrow> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation>. This work establishes new upper and lower bounds for the first outdegree Zagreb index <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="59" /> </InlineMediaObject> <EquationSource Format="TEX">\(Zg^{+}({\mathcal {D}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>Z</mi> <msup> <mi>g</mi> <mo>+</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="script">D</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> of a digraph <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {D}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">D</mi> </math></EquationSource> </InlineEquation>, expressed in terms of various structural invariants. The digraphs that achieve these extremal bounds are fully characterized. In particular, we investigate the problem of determining the orientations that maximize or minimize the first outdegree Zagreb index for the wheel graph <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10_2025_1233_Article_IEq9.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="26" /> </InlineMediaObject> <EquationSource Format="TEX">\(W_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>W</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>.</p>

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

Bounds on the first outdegree Zagreb index of digraphs

  • Hilal A. Ganie,
  • Bilal A. Rather,
  • Yilun Shang

摘要

For a digraph \({\mathcal {D}}\) D with n vertices, a arcs and the outdegree sequence \(d_1^{+}, d_2^{+},\dots , d_n^{+}\) d 1 + , d 2 + , , d n + of vertices of \({\mathcal {D}}\) D . The first outdegree Zagreb index of \({\mathcal {D}}\) D is \(Zg^{+}({\mathcal {D}})\) Z g + ( D ) , which is defined as \(Zg^{+}({\mathcal {D}})=\sum \limits _{i=1}^{n}(d_i^{+})^2\) Z g + ( D ) = i = 1 n ( d i + ) 2 . This work establishes new upper and lower bounds for the first outdegree Zagreb index \(Zg^{+}({\mathcal {D}})\) Z g + ( D ) of a digraph \({\mathcal {D}}\) D , expressed in terms of various structural invariants. The digraphs that achieve these extremal bounds are fully characterized. In particular, we investigate the problem of determining the orientations that maximize or minimize the first outdegree Zagreb index for the wheel graph \(W_n\) W n .