Chinglensana Phanjoubam, Sainkupar Mn Mawiong
We present the bounds in terms of other important graph parameters for general Sombor index which generalises both the forgotten index and the Sombor index. We also explore the Nordhaus-Gaddum-type result for the general Sombor index. We present further the relations between general Sombor index and other generalised indices: general Randić index and general sum-connectivity index.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A vertex-degree-based topological index named as Sombor index of a simple graph G with n vertices was recently introduced by I. Gutman. In this paper, we find Sombor index of m-splitting graph and m-shadow graph. Also, we determine relation between energy and Sombor energy of m-splitting graph and m-shadow graph of k-regular graph.
The Sombor index is a topological index in graph theory defined by Gutman in 2021. In this article we find the maximum Sombor index of unicyclic graphs with a fixed number of pendant vertices. We also provide the unique graph among the chosen class where the maximum Sombor index is attained.
Recently, a novel topological index, Sombor index, was introduced by Gutman, defined as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}$ denotes the degree of vertex $u$. In this paper, we first determine the maximum Sombor index among cacti with $n$ vertices and $t$ cycles, then determine the maximum Sombor index among cacti with perfect matchings. We also characterize corresponding maximum cacti.
In this work we obtain new lower and upper optimal bounds of general Sombor indices. Specifically, we have inequalities for these indices relating them with other indices: the first Zagreb index, the forgotten index and the first variable Zagreb index. Finally, we solve some extremal problems for general Sombor indices.
For a simple connected graph $G=(V,E)$, let $d(u)$ be the degree of the vertex $u$ of $G$. The general Sombor index of $G$ is defined as $$SO_α(G)=\sum_{uv\in E} \left[d(u)^2+d(v)^2\right]^α$$ where $SO(G)=SO_{0.5}(G)$ is the recently invented Sombor index. In this paper, we show that in the class of connected graphs with a fixed degree sequence (for which the minimum degree being equal to one), there exists a special extremal $BFS$-graph with minimum general Sombor index for $0<α<1$ (resp. maximum general Sombor index for either $α>1$ or $α<0$). Moreover, for any given tree, unicyclic, and bi…
The Sombor index of a graph $G$, introduced by Ivan Gutman, is defined as the sum of the weights $\sqrt{d_G(u)^2+d_G(v)^2}$ of all edges $uv$ of $G$, where $d_G(u)$ denotes the degree of vertex $u$ in $G$. The Sombor coindex is recently defined as $\bar{SO}(G)=\sum \limits_{uv\notin E(G)}\sqrt{d_G(u)^2+d_G(v)^2}$. In this paper, the maximum and second maximum Sombor index, the minimum and second minimum Sombor coindex in two-trees are determined.
Recently in 2021, Gutman introduced the Sombor index of a graph, a novel degree-based topological index. It has been shown that the Sombor index efficiently models the thermodynamic properties of chemical compounds. Assume $\mathbb{B}_n^k$ (resp. $\mathbb{V}_n^k$) comprises all graphs with order $n$ having number of bridges (resp. vertex-connectivity) $k$. Horoldagva & Xu (2021) characterized graphs achieving the maximum Sombor index of graphs in $\mathbb{B}_n^k$. This paper characterizes graphs achieving the minimum Sombor index in $\mathbb{B}_n^k$. Certain auxiliary operation on graphs in $\…
The Sombor index is one of the geometry-based descriptors, which was defined as $$SO(G)=\sum_{uv\in E(G)}\sqrt{d^{2}(u)+d^{2}(v)},$$ where $d(u)$ (resp. $d(v)$) denotes the degree of vertex $u$ (resp. $v$) in $G$. In this note, we determine the maximum and minimum graphs with respect to the Sombor index among the set of graphs with vertex connectivity (resp. edge connectivity) at most $k$, which solves an open problem on the Sombor index proposed by Hayat and Rehman [On Sombor index of graphs with a given number of cut-vertices, MATCH Commun. Math. Comput. Chem. 89 (2023) 437--450]. For some o…
Let $G=(V(G),E(G))$ be a graph and $d(v)$ be the degree of the vertex $v\in V(G)$. The exponential reduced Sombor index of $G$, denoted by $e^{SO_{red}}(G)$, is defined as $$e^{SO_{red}}(G)=\sum_{uv\in E(G)}e^{\sqrt{(d(u)-1)^2+(d(v)-1)^2}}.$$ We obtain a characterization of extremal trees with the maximal exponential reduced Sombor index among all chemical trees of order $n$. This result shows the conjecture on the exponential reduced Sombor index proposed by Liu, You, Tang and Liu [On the reduced Sombor index and its applications, MATCH Commun. Math. Comput. Chem. 86 (2021) 729--753] is negat…
Let $d_v$ be the degree of the vertex $v$ in a connected graph $G$. The first Banhatti-Sombor index of $G$ is defined as $BSO(G) =\sum_{uv\in E(G)}\sqrt{\frac{1}{d^2_u}+\frac{1}{d^2_v}}$, which is a new vertex-degree-based topological index introduced by Kulli. In this paper, the mathematical relations between the first Banhatti-Sombor index and some other well-known vertex-degree-based topological indices are established. In addition, the trees extremal with respect to the first Banhatti-Sombor index on trees and chemical trees are characterized, respectively.
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. The Sombor index of the graph $G$ is a degree-based topological index, defined as $$SO(G)=\sum_{uv \in E}\sqrt{d(u)^2+d(v)^2},$$ in which $d(x)$ is the degree of the vertex $x \in V$ for $x=u, v$. In this paper, we characterize the extremal trees with a given degree sequence that maximizes the Sombor index.
New boundes for Sombor index of Graphs
本研究利用三角不等式、多种拓扑指数及中心性离散性指数推导了图Sombor指数的新界，可给出该指数的估计值与不等式形式的误差区间，明确其精度极限。
Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. In this paper, we study this index for certain graphs and we examine the effects on $SO(G)$ when $G$ is modified by operations on vertex and edge of $G$. Also we present bounds for the Sombor index of join and corona product of two graphs.
A new geometric background of graph invariants was introduced by Gutman, of which the simplest is the second Sombor index $SO_2$, defined as $SO_2=SO_2(G)=\sum_{uv\in E}\frac{|d^2_G(u)-d^2_G(v)|}{d^2_G(u)+d^2_G(v)}$, where $G = (V, E)$ is a simple graph and $d_G(v)$ denotes the degree of $v$ in $G$. In this paper, the chemical applicability of the second Sombor index is investigated and it is shown that the the second Sombor index is useful in predicting physicochemical properties with high accuracy compared to some well-established and often used indices. Also, we obtain a bound for the secon…
On the Sombor index of trees with degree restrictions
本文研究具有度限制的树的Sombor指数，重新发现贪心树和交替贪心树分别达到最小值和最大值，并完整刻画了所有极值树，还比较了不同度序列的树并得出若干推论。
The Sombor index of a graph $G$ was recently introduced by Gutman from the geometric point of view, defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{d(u)^2+d(v)^2}$, where $d(u)$ is the degree of a vertex $u$. For two real numbers $α$ and $β$, the $α$-Sombor index and general Sombor index of $G$ are two generalized forms of the Sombor index defined as $SO_α(G)=\sum_{uv\in E(G)}(d(u)^α+d(v)^α)^{1/α}$ and $SO_α(G;β)=\sum_{uv\in E(G)}(d(u)^α+d(v)^α)^β$, respectively. A $k$-polygonal cactus is a connected graph in which every block is a cycle of length $k$. In this paper, we establish a lower bound on $α$…
In 2021, the Sombor index was introduced by Gutman, which is a new degree-based topological molecular descriptors. The Sombor index of a graph $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, where $d_G(v)$ is the degree of the vertex $v$ in $G$. Let $\mathscr{T}_{n,m}$ and $\mathscr{U}_{n,m}$ be the set of trees and unicyclic graphs on $n$ vertices with fixed matching number $m$, respectively. In this paper, the tree and the unicyclic graph with the maximum Sombor index are determined among $\mathscr{T}_{n,m}$ and $\mathscr{U}_{n,m}$, respectively.
On extremal Sombor index of trees with a given dissociation number $φ$
本文研究了具有给定 dissociation number $φ$ 的树的最大 Sombor index 问题，确定了阶为 $\mathbf{n}$ 的树的最大值，并给出了取得该最大值的唯一图。
The general Sombor index of $G$ is defined as $SO_α(G)= \sum_{uv\in G}\left(d^2_{G}(u)+d^2_{G}(v)\right)^α$. For $0<α<1$, we have the upper bound of $SO_α(G)$ on unicyclic graphs with a fixed diameter, and the extremal graph is also characterized.
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The Sombor and reduced Sombor indices of $G$ are defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{deg_G(u)^2+deg_G(v)^2}$ and $SO_{red}(G)=\sum_{uv\in E(G)}\sqrt{(deg_G(u)-1)^2+(deg_G(v)-1)^2}$, respectively. We denote by $H_{n,ν}$ the graph constructed from the star $S_n$ by adding $ν$ edge(s) $(0\leq ν\leq n-2)$, between a fixed pendent vertex and $ν$ other pendent vertices. Réti et al. [T. Réti, T. Došlić and A. Ali, On the Sombor index of graphs, $\textit{Contrib. Math. }$ $\textbf{3}$ (2021) 11-18] proposed a conjecture that the graph…
Motivated by the recently introduced topological index, the Somber index, we define a new topological index of a graph in this paper, we call it Sombor coindex. The Sombor coindex is defined by considering analogous contributions from the pairs of non-adjacent vertices, capturing, thus, and quantifying a possible influence of remote pairs of vertices. We give several properties of the Somber coindex and its relations to the Sombor index, the Zagreb (co)indices, forgotten coindex and other important graph parameters. We also compute the bounds of the Somber coindex of some graph operations and …
Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph $G$ as $SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}=d_{G}(u)$ denotes the degree of vertex $u$ in graph $G$. Extremal problems on the Sombor index for trees with a given diameter has been considered by Chen et al. [H. Chen, W. Li, J. Wang, Extremal values on the Sombor index of trees, MATCH Commun. Math. Comput. Chem. 87 (2022) 23--49] and Li et al. [S. Li, Z. Wang, M. Zhang, On the extremal Sombor index of trees with a given diameter, Appl. Math. Comput. 416 (2022) 126…
Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let $\mathscr{T}_{n,Δ}$ and $\mathscr{U}_{n,Δ}$ be the set of trees and unicyclic graphs with $n$ vertices and maximum degree $Δ$, respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among $\mathscr{T}_{n,Δ}$ and $\mathscr{U}_{n,Δ}$ are characterized.
Topological indices are a class of numerical invariants that predict certain physical and chemical properties of molecules. Recently, two novel topological indices, named as Sombor index and reduced Sombor index, were introduced by Gutman, defined as $$SO(G)=\sum_{uv\in E(G)}\sqrt{d_{G}^{2}(u)+d_{G}^{2}(v)},$$ $$SO_{red}(G)=\sum_{uv\in E(G)}\sqrt{(d_{G}(u)-1)^{2}+(d_{G}(v)-1)^{2}},$$ where $d_{G}(u)$ denotes the degree of vertex $u$ in $G$. In this paper, our aim is to order the chemical trees, chemical unicyclic graphs, chemical bicyclic graphs and chemical tricyclic graphs with respect to So…
A note on extremal Sombor indices of trees with a given degree sequence
该研究将给定度序列的树的Sombor指数极值问题纳入已有成果框架，证明贪心树的Sombor指数最小，交替贪心树的该指数最大。
We introduce a degree-based variable topological index inspired on the power (or generalized) mean. We name this new index as the mean Sombor index: $mSO_α(G) = \sum_{uv \in E(G)} \left[\left( d_u^α+d_v^α\right) /2 \right]^{1/α}$. Here, $uv$ denotes the edge of the graph $G$ connecting the vertices $u$ and $v$, $d_u$ is the degree of the vertex $u$, and $α\in \mathbb{R} \backslash \{0\}$. We also consider the limit cases $mSO_{α\to 0}(G)$ and $mSO_{α\to\pm\infty}(G)$. Indeed, for given values of $α$, the mean Sombor index is related to well-known topological indices such as the inverse sum ind…
On the Elliptic Sombor and Euler Sombor indices of Corona product of certain graphs
该研究针对近期提出的椭圆Sombor指数与Euler Sombor指数两类拓扑指数，通过联运算、Corona积操作处理路径、圈、完全图等标准图，推导计算了所得生成图的这两类拓扑指数，丰富了图论拓扑指数的运算研究结果。
Let $G$ be a simple undirected graph with vertex set $V(G)=\{v_1, v_2, \ldots, v_n\}$ and edge set $E(G)$. The Sombor matrix $\mathcal{S}(G)$ of a graph $G$ is defined so that its $(i,j)$-entry is equal to $\sqrt{d_i^2+d_j^2}$ if the vertices $v_i$ and $v_j$ are adjacent, and zero otherwise, where $d_i$ denotes the degree of vertex $v_i$ in $G$. In this paper, lower and upper bounds on the spectral radius, energy and Estrada index of the Sombor matrix of graphs are obtained, and the respective extremal graphs are characterized.
On the Sombor index of the total graph and the unit graph of commutative rings
该文针对$n$取$2k、p^α$等四类值时的$\u2124_n$，研究其全图与单位图的Sombor指数，还拓展计算了任意有限局部环的Sombor指数，丰富了环论与图论交叉领域的相关结果。
Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. Let $G$ be a connected graph constructed from pairwise disjoint connected graphs $G_1,\ldots ,G_k$ by selecting a vertex of $G_1$, a vertex of $G_2$, and identifying these two vertices. Then continue in this manner inductively. We say that $G$ is a polymer graph, obtained by point-attaching from monomer units $G_1,...,G_k$. In this paper, we consider some particular cases of these graphs that are of importance in chemistry …
Introduced by Gutman in 2021, the Sombor index is a novel graph-theoretic topological descriptor possessing potential applications in the modeling of thermodynamic properties of compounds. Let G^k_n be the set of all n-vertex connected graphs with k cut-vertices. In this paper, we present minimum Sombor indices of graphs in G^k_n. The corresponding extremal graphs have been characterized as well.
The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of $\sqrt{d_i^2+d_j^2}$, where $d_i$ is the degree of the $i$-th vertex. It has been conceived using geometric considerations. Recently, a series of new SO-like degree-based graph invariants (denoted by $SO_1, SO_2,..., SO_6$) is taken into consideration, when the geometric background of several classical topological indices (Zagreb, Albertson) has considered. In this paper, we compute and study these new indices for some graphs, cactus chains and polymers.
Resolving Open Problems on the Euler Sombor Index
本文针对 Khanra 和 Das 提出的 Euler Sombor 指数开放问题，确定固定阶数与围长的单圈图及连通图的最小 $EUS$ 与极值结构，并分类固定阶数和叶子数时的最大 $EUS$ 连通图。
On Sombor Index of Graphs
本文研究连通图的Sombor指数，给出其精确上下界，并刻画了达到这些界的图。
Let $G=(V(G),E(G))$ be a simple graph with vertex set $V(G)=\{v_{1},v_{2},\cdots, v_{n}\}$ and edge set $E(G)$. The $p$-Sombor matrix $\mathcal{S}_{p}(G)$ of $G$ is the square matrix of order $n$ whose $(i,j)$-entry is equal to $((d_{i})^{p}+(d_{j})^{p})^{\frac{1}{p}}$ if $v_{i}\sim v_{j}$, and 0 otherwise, where $d_{i}$ denotes the degree of vertex $v_{i}$ in $G$. In this paper, we study the relationship between $p$-Sombor index $SO_{p}(G)$ and $p$-Sombor matrix $\mathcal{S}_{p}(G)$ by the $k$-th spectral moment $N_{k}$ and the spectral radius of $\mathcal{S}_{p}(G)$. Then we obtain some boun…
Vertex-degree-based topological indices have recently gained a lot of attention from mathematical chemists. One such index that we focus on in this paper is called Sombor index. After its definition in late 2020, the Sombor index was quickly recognized as a valuable research topic. In this paper we partially answer the open question of finding the extremal trees with respect to this index for a fixed degree sequence. Particularly we focus on the lower bound and proceed to show that greedy tree minimizes the Sombor index for a given degree sequence.
Bounds on Elliptic Sombor and Euler Sombor indices of join and corona product of graphs
本文计算了任意图的连接与冠积的椭圆Sombor和欧拉Sombor指数的上下界，并证明当两个图均为正则图时这些界可达到。
Diminished Sombor index and its relationship with topological indices
本文研究了简单图的 Diminished Sombor 指数，利用多种经典拓扑指数为其建立了精确界，并刻画了达到等号条件的极图。
Structural Properties and Applications of the Augmented Sombor Index
本文定义并研究了增强Sombor指数，建立了其极值界并刻画了极图，包括单圈图、树、二部图和化学图，并通过QSPR分析验证了其化学适用性。
On the maximal Sombor index of quasi-tree graphs
本文研究了阶为n且度为k的拟树图的最大Sombor指数问题，确定了该类图中最大、次大和第三大的Sombor指数，并分别刻画了对应的极图。
On Hyperbolic Sombor index of graphs
本文纠正了Hyperbolic Sombor指标的先前错误，为树、单圈图和双圈图建立了新结果，推导了关于边数和度数的上下界并刻画了极值图。
On the Hyperbolic Sombor Index and Its Counterpart
该研究纠正了双曲Sombor指数相关研究中的不准确之处，推导了加边后该指数增减的充分条件、基于图阶数和大小的下界，并得到其对应CDSO指数的同类结果。
On Euler-Sombor Energy of Graphs
本文基于2024年Gutman等人定义的欧拉-松博尔（ES）指数，提出图的ES矩阵及ES特征值概念，并讨论了几类图的ES特征值与能量。
On the Diminished Sombor Index of Fixed-Order Molecular Graphs With Cyclomatic Number at Least 3
本文研究了固定阶和环数的分子图的最小减损Sombor指数，给出了在$n\ge 2(\ell-1)\ge4$条件下使DSO指数最小化的所有图，回应了相关文献中的猜想。
On the Augmented Sombor Index of Graphs
本文研究了图的增强索博尔指数，证明了在单环图中最大度数的图最大化该指数，并利用边删除性质表征了具有指定连通性的图的最大指数图。
Theta-Relations Among Degree-Based Tree Indices
该研究探讨树的Albertson、Sombor、Sigma三种基于度的拓扑指数的关系，建立了Sigma对Sombor的严格双侧界并证明二者渐近等价，推导了Sombor与Albertson的Θ关系，明确了Sombor的中间描述符作用及两类不规则性度量的关联。
Greedy trees have minimum Sombor indices
本研究针对图论中新型不变量Sombor指数的极值问题，证明在给定度序列的所有树集合中，贪婪树具有最小的Sombor指数，丰富了图指数极值理论。
Sombor index and eigenvalues of weakly zero-divisor graph of commutative rings
本文研究交换环的弱零因子图，确定了整数模环的Sombor指标，并给出其Sombor谱与能量的界。
Sombor index of clean graphs
本文定义环的清洁图及其诱导子图 $Cl_2(R)$，并研究模 $n$ 整数环对应子图 $Cl_2(\mathbb{Z}_n)$ 在不同正整数 $n$ 下的 Sombor 指数。
Maximum values of the Sombor-index-like graph invariants of trees and connected graphs
本文针对Gutman提出的类Sombor指数不变量，解决了给定顶点数分子树中SO5和SO6的最大值问题，并确定了一类连通图中SO5的最大值。
For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{i}$ the degree of vertex $v_{i}$. Let $f(x, y)>0$ be a real symmetric function in $x$ and $y$. The weighted adjacency matrix $A_{f}(G)$ of a graph $G$ is a square matrix, where the $(i,j)$-entry is equal to $\displaystyle f(d_{i}, d_{j})$ if the vertices $v_{i}$ and $v_{j}$ are adjacent and 0 otherwise. Li and Wang \cite{U9} tried to unify methods to study spectral radius of weighted adjacency matrices of graphs weighted by various topological indices. If $\displaystyle f'_{x}(x, y)\geq0$ and $\displaystyle f''_{x}(x, y)\geq0$, then $\displ…
Bounds of Trees with Degree Sequence-Based Topological Indices on Specialized Graph Classes
本文针对特定图类（正则图、刺图、化学树）研究Adriatic指标和Sombor指标等基于度序列的拓扑指标，利用函数凸性推导树的界，并通过毛毛虫树示例展示计算，揭示度序列与指标值的关联。
In this article, the distance magic index of certain important classes of partite graphs are determined.
Applications in chemistry motivated mathematicians to define different topological indices for different types of graphs. The Hyper-Zagreb index (HM) is an important tool as it integrates the first and the second Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.
In this paper, we first review the weighted-versiion of the handshaking lemma based on the idea of a weighted vertex-edge incidence matrix of a given graph $G$. Then, we obtain a generalized version of the handshaking lemma based on the concept of the clique value. We also define a generalized version of Randic index. More importantly, we prove an upper bound for the generalized Randic index of a graph $G$. We finally concluse the paper with some disscussions about possible future works.
For a graph $G$ with vertex set $V_{G}$ and edge set $E_{G}$, the symmetric division deg index is defined as $SDD(G)=\sum\limits_{uv\in E_{G}}(\frac{d_{u}}{d_{v}}+\frac{d_{v}}{d_{u}})$, where $d_{u}$ denotes the degree of vertex $u$ in $G$. In 2018, Furtula et al. confirmed the quality of SDD index exceeds that of some more popular VDB indices, in particular that of the GA index. They shown a close connection between the SDD index and the earlier well-established GA index. Thus it is meaningful and important to consider the chemical and mathematical properties of the SDD index. In this paper, …
Sufficient conditions for matching extendability in terms of the Zeroth-order General Randić Index
研究图匹配可扩展性，基于零阶广义兰迪奇指数给出图成为\(k\)-可扩展图、\(n\)-因子临界图等的充分条件。
The Wiener polarity index of a graph is defined as the number of unordered pairs of vertices at distance three. In recent years, this topological index was extensively studied since it has many known applications in chemistry and also in network theory. In this paper, we generalize the result of Behmaram, Yousefi-Azari, and Ashrafi proved in 2012 for calculating the Wiener polarity index of a graph. An important advantage of our generalization is that it can be used for graphs that contain $4$-cycles and also for graphs whose different cycles have more than one common edge. In addition, using …
The Graovac-Pisanski index, also called the modified Wiener index, was introduced in 1991 and represents an extension of the original Wiener index, because it considers beside the distances in a graph also its symmetries. Similarly as Wiener in 1947 showed the correlation of the Wiener indices of the alkane series with the boiling points, in 2018 the connection between the Graovac-Pisanski index and the melting points of some hydrocarbon molecules was established. In this paper, we prove that the Graovac-Pisanski index of any connected bipartite graph as well as of any connected graph on an ev…
There is powerful relation between the chemical behaviour of chemical compounds and their molecular structures. Topological indices defined on these chemical molecular structures are capable to predict physical properties, chemical reactivity and biological activity. In this article, a new topological index named as Neighbourhood Zagreb index $(M_N)$ is presented. Here the chemical importance of this newly introduced index is studied and some explicit results for this index of different product graphs such as Cartesian, Tensor and Wreath product is derived. Some of these results are applied to…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。