相关论文: On certain topological indices of graphs
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
Topological indices play an important role in mathematical chemistry especially in the quantitative structure-property relationship (QSPR) and quantitative structure-activity relationship (QSAR). Recent research indicates that the augmented…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
A graph $G$ consists of two parts, the vertices and edges. The vertices constitute the vertex set $V(G)$ and the edges, the edge set. An edge \( e=xy \), \( ev \)-dominates not only the vertices incident to it but also those adjacent to…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
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…
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…
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…
In this paper, degree-based topological indices play a key role in the structural analysis of graphs in this paper and have significant uses in chemical graph theory. We investigate the connections between three such tree indices: the…
We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound if and only if it is the disjoint union of incidence graphs…
In this paper, we study topological indices in random spiro chains via a martingale approach. In which their explicit analytical expressions of the exact distribution, expected value and variance are obtained. As n goes to infinity, the…
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 study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…
Tur\'{a}n type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Tur\'{a}n type extremal problem is how to maximize (signless Laplacian) spectral…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thought of as a powerful tool for modeling quantitative…