Related papers: On the Difference of Atom-Bond Sum-Connectivity an…
Edges in a network can be divided into two kinds according to their different roles: some enhance the locality like the ones inside a cluster while others contribute to the global connectivity like the ones connecting two clusters. A recent…
The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived from RouteViews BGP table dumps (BTDs). However, BTDs do not capture…
The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccentric index for double graph and double cover. Also we give…
There are various topological indices such as degree based topological indices, distance based topological indices and counting related topological indices etc. These topological indices correlate certain physicochemical properties such as…
The intersection index at a common point of two analytic varieties of complementary dimensions in $\Bbb C^n$ is positive. This observation, which has been called a ``cornerstone'' of algebraic geometry ([GH, p.~62]), is a simple consequence…
A general expression for calculating the bond incident degree (BID) indices of certain triangular chain graphs is derived. The extremal triangular chain graphs with respect to several well known BID indices are also characterized over a…
Abc-boost is a new line of boosting algorithms for multi-class classification, by utilizing the commonly used sum-to-zero constraint. To implement abc-boost, a base class must be identified at each boosting step. Prior studies used a very…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the \emph{sum index} of this graph. In this paper, we present…
Topological indices are molecular descriptors that describe the properties of chemical compounds. These topological indices correlate specific physico-chemical properties like boiling point, enthalpy of vaporization, strain energy, and…
Aspect-based Sentiment Analysis (ABSA) seeks to predict the sentiment polarity of a sentence toward a specific aspect. Recently, it has been shown that dependency trees can be integrated into deep learning models to produce the…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
The modified Albertson index, denoted by $A\!^*\!$, of a graph $G$ is defined as $A\!^*\!(G)=\sum_{uv\in E(G)} |(d_{u})^{2}- (d_{v})^{2}|$, where $d_u$, $d_v$ denote the degrees of the vertices $u$, $v$, respectively, of $G$ and $E(G)$ is…
Link prediction is a technique that uses the topological information in a given network to infer the missing links in it. Since past research on link prediction has primarily focused on enhancing performance for given empirical systems,…
Recently, Ali et al. posed several open problems concerning extremal graphs with respect to the ABS index. These problems involve characterizing graphs that attain the maximum ABS index within specific graph classes, including: connected…
The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient…
The bond incident degree (BID) index of a graph \(G\) is defined as \(\BID(G) = \sum_{u_1u_2\in E(G)} f(d(u_1), d(u_2))\), where \(f(x,y)=f(y,x)\) is a real-valued function. In this paper, using graph transformation methods, we establish…
The symmetric difference of two graphs $G_1,G_2$ on the same set of vertices $V$ is the graph on $V$ whose set of edges are all edges that belong to exactly one of the two graphs $G_1,G_2$. For a fixed graph $H$ call a collection ${\cal G}$…
The global functional brain network (graph) is more suitable for characterizing brain states than local analysis of the connectivity of brain regions. Therefore, graph-theoretic approaches are the natural methods to study the brain.…
In this paper, we have studied bounds based on topological indicators, from which we selected Albertson index $\mathrm{irr}$ and the Sigma index $\sigma$. The Sigma index was defined through the following relationship: \[…