Chunxiang Wang

Bio: Chunxiang Wang is an academic researcher from Central China Normal University. The author has contributed to research in topics: Multiplicative function & Domination analysis. The author has an hindex of 11, co-authored 24 publications receiving 297 citations.

Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs

Abstract: For a graph $$G = (V(G), E(G))$$ , let d(u), d(v) be the degrees of the vertices u, v in G. The first and second Zagreb indices of G are defined as $$ M_1(G) = \sum _{u \in V(G)} d(u)^2$$ and $$ M_2(G) = \sum _{uv \in E(G)} d(u)d(v)$$ , respectively. The first (generalized) and second Multiplicative Zagreb indices of G are defined as $$\Pi _{1,c}(G) = \prod _{v \in V(G)}d(v)^c$$ and $$\Pi _2(G) = \Pi _{uv \in E(G)} d(u)d(v)$$ , respectively. The (Multiplicative) Zagreb indices have been the focus of considerable research in computational chemistry dating back to Narumi and Katayama in 1980s. Denote by $${\mathcal {G}}_{n}$$ the set of all Eulerian graphs of order n. In this paper, we characterize Eulerian graphs with first three smallest and largest Zagreb indices and Multiplicative Zagreb indices in $${\mathcal {G}}_{n}$$ .

Further results on computation of topological indices of certain networks

Abstract: 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 boiling point, stability of chemical compounds. In this study, the authors compute the sum-connectivity index and multiplicative Zagreb indices for certain networks of chemical importance such as silicate networks, hexagonal networks, oxide networks, and honeycomb networks. Moreover, a comparative study using computer-based graphs has been made to clarify their nature for these families of networks.

Further results on computation of topological indices of certain networks

Abstract: 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 boiling point, stability of chemical compounds. In this paper, we compute the sum-connectivity index and multiplicative Zagreb indices for certain networks of chemical importance like silicate networks, hexagonal networks, oxide networks, and honeycomb networks. Moreover, a comparative study using computer-based graphs has been made to clarify their nature for these families of networks.

Cacti with Extremal PI Index

Abstract: The vertex PI index $PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)]$ is a distance-based molecular structure descriptor, where $n_{xy}(x)$ denotes the number of vertices which are closer to the vertex $x$ than to the vertex $y$ and which has been the considerable research in computational chemistry dating back to Harold Wiener in 1947. A connected graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we completely determine the extremal graphs with the largest and smallest vertex PI indices among all the cacti. As a consequence, we obtain the sharp bounds with corresponding extremal cacti and extend a known result.

Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs

Abstract: For a graph $$G = (V(G), E(G))$$ , let d(u), d(v) be the degrees of the vertices u, v in G. The first and second Zagreb indices of G are defined as $$ M_1(G) = \sum _{u \in V(G)} d(u)^2$$ and $$ M_2(G) = \sum _{uv \in E(G)} d(u)d(v)$$ , respectively. The first (generalized) and second Multiplicative Zagreb indices of G are defined as $$\Pi _{1,c}(G) = \prod _{v \in V(G)}d(v)^c$$ and $$\Pi _2(G) = \Pi _{uv \in E(G)} d(u)d(v)$$ , respectively. The (Multiplicative) Zagreb indices have been the focus of considerable research in computational chemistry dating back to Narumi and Katayama in 1980s. Denote by $${\mathcal {G}}_{n}$$ the set of all Eulerian graphs of order n. In this paper, we characterize Eulerian graphs with first three smallest and largest Zagreb indices and Multiplicative Zagreb indices in $${\mathcal {G}}_{n}$$ .

The hosoya index of graphs formed by a fractal graph

Abstract: The computational complexity of the Hosoya index of a given graph is NP-Complete. Let RT(G) be the graph constructed from R(G) by a triangle instead of all vertices of the initial graph G. In this ...

Operations of Nanostructures via SDD, ABC4 and GA5 indices

Abstract: Recently, nano structures have opened new dimensions in industry, electronics, and pharmaceutical and biological therapeutics The topological graph indices are numerical tendencies that often depict quantitative structural activity/property/toxicity relationships and correlate certain physio-chemical properties such as boiling point, stability, and strain energy, of respective nano-material In this article, we established closed forms of various degree-based topological graph indices of nano-structures of 2D-lattice, nano-tube and nano-torus of TUC4C8[r,s]