相关论文: General cut method for computing Szeged-like topol…

The revised Szeged index $Sz^*(G)$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and…

Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some topological indices. In this paper, we extended the work and…

Graphlets are induced subgraph patterns and have been frequently applied to characterize the local topology structures of graphs across various domains, e.g., online social networks (OSNs) and biological networks. Discovering and computing…

Recently, a couple of degree-based topological indices, defined using a geometrical point of view of a graph edge, have attracted significant attention and being extensively investigated. Furtula and Oz [Complementary Topological Indices,…

The $M$-polynomial was introduced by Deutsch and Klav\v{z}ar in 2015 as a graph polynomial to provide an easy way to find closed formulas of degree-based topological indices, which are used to predict physical, chemical, and pharmacological…

The wreath product of graphs is a graph composition inspired by the notion of wreath product of groups, with interesting connections with Geometric Group Theory and Probability. This paper is devoted to the description of some degree and…

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…

The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of $k$-uniform partial cube-hypergraphs.…

Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…

Topological indices have important role in theoretical chemistry for QSPR researches. Among the all topological indices the Randi\'c and the Zagreb indices have been used more considerably than any other topological indices in chemical and…

Let $\mathbb{G} = (\mathcal{V}, \mathcal{E})$ be a simple connected graph, where $\mathcal{V}$ and $\mathcal{E}$ denote the vertex and edge sets, respectively. The first Zagreb index is defined as $\mathcal{M}_{1}(\mathbb{G}) = \sum_{v \in…

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…

In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses,…

This work aims to assess the molecular architectures of anti-tuberculosis drugs using both degree-based topological indices and novel distance based indices. We can represent the chemical arrangement as a graph, with atoms serving as the…

We consider topological indices I that are sums of f(deg(u)) f(deg(v)), where {u,v} are adjacent vertices and f is a function. The Randi{\'c} connectivity index or the Zagreb group index are examples for indices of this kind. In earlier…

In this paper, four novel topological indices named as neighbourhood version of forgotten topological index (F_N), modified neighbourhood version of Forgotten topological index ($F_N^*$), neighbourhood version of second Zagreb index…

Topological indices are parameters associated with graphs that have many applications in different areas such as mathematical chemistry. Among various topological indices, the Wiener index is classical \cite{w}. In this paper, we prove a…

Topological correctness plays a critical role in many image segmentation tasks, yet most networks are trained using pixel-wise loss functions, such as Dice, neglecting topological accuracy. Existing topology-aware methods often lack robust…

With the emergence of graph databases, the task of frequent subgraph discovery has been extensively addressed. Although the proposed approaches in the literature have made this task feasible, the number of discovered frequent subgraphs is…

Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topological index is a molecular descriptor used to study specific physicochemical…