期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 85 (3)
lncRNA affects the expression of nearby protein-coding genes and interfaces with related RNA binding proteins to exert functions. It is necessary to d......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (1)
Let G be a finite and simple graph with vertex set V(G). The Lanzhou index is defined as: Lz(G) = Sigma(u is an element of V(G)) d((G) over bar)(u)d(G......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (2)
Let G be a simple connected graph of order n with m edges and diameter d. Let W, WW, H, and RCW be the Wiener index, hyper-Wiener index, Harary index,......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (2)
The Wiener polarity index W-p(G) of a graph G, proposed by Wiener in 1947, is the number of unordered pairs of vertices {u, v} of G such that the dist......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (3)
Let A be the ABC matrix of graph G. The A-energy E-A(G) is the sum of absolute values of the eigenvalues of matrix A. In this paper, we are interested......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (3)
The energy E(G) of a graph G is the sum of the absolute values of all the eigenvalues of its adjacency matrix A(G). For a graph G with Randic index R(......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (1)
Let G be a simple graph with vertex set V(G) and edge set E(G). The inverse sum indeg index of G is defined as ISI(G) = Sigma(uv is an element of E(G)......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (3)
The resolvent energy of a graph G of order n is defined as ER(G) = Sigma(n)(i=1)(n - lambda(i))(-1), where lambda(1,) lambda(2), ..., lambda(n) are th......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (3)
Based on elementary geometry, a novel vertex-degree-based molecular structure descriptor was recently introduced by Gutman in the chemical graph theor......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (3)
Recently, Gutman defined a new vertex-degree-based graph invariant, named the Sombor index SO of a graph G, and is defined by SO(G) = Sigma(uv is an e......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (1)
Gutman (J Chem Inf Comput Sci, 34 (1994) 1087-1089) defined the Gutman index of a graph G with vertex set V(G) as Gut(G) = Sigma({u,v}subset of V(G)) ......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (2)
The Wiener index W(G) of a connected graph G is defined as W(G) = Sigma({u, v} is an element of V(G)) d(G)(u, v), where d(G)(u,v) is the distance betw......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (2)
For a connected graph G = (V-G, E-G), the cover cost and the reverse cover cost of a vertex v in G are, respectively, defined as CCG(v) = Sigma(u is a......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (2)
Steiner distance d(G)(S) is a natural generalization of the concept of distance in a graph. For a connected graph G of order at least 2 and S subset o......
期刊： MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021; 86 (3)
In this note we study the behavior of largest matching root, Hosoya index and matching energy under two graph structural transformations. As an applic......
