相关论文: Note on PI and Szeged indices

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…

Let $\prod(G)$ be Multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which has been the interest of researchers in the filed of material…

Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order…

Carbon nanotube Y-junctions are of great interest to the next generation of innovative multi-terminal nanodevices. Topological indices are graph-theoretically based parameters that describe various structural properties of a chemical…

Graph theory provides powerful tools for modeling concepts in number theory, leading to the introduction of graphs derived from arithmetic properties. One such structure is the divisor prime graph, $G_{Dp(n)}$. For any positive integer $n$,…

A topological index of a graph $G$ is a numerical quantity that describes its topology. Reverse degree-based topological indices play an important role in finding topological descriptors. Azacitidine, Decitabine, and Guadecitabine are…

The vertex $k$-partiteness $v_k(G)$ of graph $G$ is defined as the fewest number of vertices whose deletion from $G$ yields a $k$-partite graph. In this paper, we introduce two concepts: monotonic decreasing topological index and monotonic…

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

Recent advances and achievements of artificial intelligence (AI) as well as deep and graph learning models have established their usefulness in biomedical applications, especially in drug-drug interactions (DDIs). DDIs refer to a change in…

In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence…

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and…

Due to their capacity to encode rich structural information, labeled graphs are often used for modeling various kinds of objects such as images, molecules, and chemical compounds. If pattern recognition problems such as clustering and…

Revealing the structural features of a complex system from the observed collective dynamics is a fundamental problem in network science. In order to compute the various topological descriptors commonly used to characterize the structure of…

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

This study conducts a Quantitative Structure Property Relationship (QSPR) analysis to explore the correlation between the physical properties of drug molecules and their topological indices using machine learning techniques. While prior…

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…

Let $G=(V,E)$ be a simple connected graph and $d_i$ be the degree of its $i$th vertex. In a recent paper [J. Math. Chem. 46 (2009) 1369-1376] the first geometric-arithmetic index of a graph $G$ was defined as $$GA_1=\sum_{ij\in E}\frac{2…

The Zagreb index of a hypergraph is defined as the sum of the squares of the degrees of its vertices. A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called bicyclic if $n=m(k-1)-1$. In this paper, we determine the…