Chunxiang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chunxiang Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Shaohui Wang
Department of Mathematics
9 shared publications - Jia-Bao Liu
School of Mathematics and Physics, Anhui Jianzhu University, Hefei, China
5 shared publications - Bing Wei
Department of Mathematics, University of Mississippi, Oxford, MS 38677, USA
3 shared publications - Melaku Berhe Belay
Nanotechnology Center of Excellence, Addis Ababa Science and Technology University, Addis Ababa, Ethiopia
3 shared publications Lin Chen
2 shared publications- Abdul Jalil M. Khalaf
Department of Mathematics, Faculty of Computer Science & Mathematics, University of Kufa, Najaf, Iraq
1 shared publication
Latest Publications
- Open Access
- 1 September 2022
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 56 (5) , 3635-3642
A bound for the Aα-spectral radius of a connected graph after vertex deletion
G is a simple connected graph with adjacency matrix A(G) and degree diagonal matrix D(G). The signless Laplacian matrix of G is defined as Q(G) = D(G) + A(G). In 2017, Nikiforov [1] defined the matrix Aα(G) = α D(G) + (1 − α)A(G) for α ∈ [0,1]. The Aα-spectral radius of G is the maximum eigenvalue of Aα (G). In 2019, Liu et al. [2] defined the matrix Θk(G) as Θk (G) = kD(G) + A(G), for k ∈ ℝ. In this paper, we present a new type of lower bound for the Aα-spectral radius of a graph after vertex deletion. Furthermore, we deduce some corollaries on Θk (G), A(G), Q(G) matrices.
- 1 September 2022
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 56 (5) , 3635-3642
Open AccessA bound for the Aα-spectral radius of a connected graph after vertex deletion
G is a simple connected graph with adjacency matrix A(G) and degree diagonal matrix D(G). The signless Laplacian matrix of G is defined as Q(G) = D(G) + A(G). In 2017, Nikiforov [1] defined the matrix Aα(G) = α D(G) + (1 − α)A(G) for α ∈ [0,1]. The Aα-spectral radius of G is the maximum eigenvalue of Aα (G). In 2019, Liu et al. [2] defined the matrix Θk(G) as Θk (G) = kD(G) + A(G), for k ∈ ℝ. In this paper, we present a new type of lower bound for the Aα-spectral radius of a graph after vertex deletion. Furthermore, we deduce some corollaries on Θk (G), A(G), Q(G) matrices.
- Open Access
On Hermitian Adjacency Matrices for Mixed Graphs
We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an arc from $u$ to $v$ is equal to the $k$-th( or the third) root of unity, i.e. ${\omega} = cos(2{\pi}/k) + \textbf{i} \ sin(2{\pi}/k), k {\geq} 3$; the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. In this paper, we characterize the cospectrality conditions for a mixed graph and its underlying graph. In section 4, we determine a sharp upper bound on the spectral radius of mixed graphs, and provide the corresponding extremal graphs.Open AccessOn Hermitian Adjacency Matrices for Mixed Graphs
We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an arc from $u$ to $v$ is equal to the $k$-th( or the third) root of unity, i.e. ${\omega} = cos(2{\pi}/k) + \textbf{i} \ sin(2{\pi}/k), k {\geq} 3$; the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. In this paper, we characterize the cospectrality conditions for a mixed graph and its underlying graph. In section 4, we determine a sharp upper bound on the spectral radius of mixed graphs, and provide the corresponding extremal graphs. - 17 February 2021
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 24 (2) , 589-601
Topological indices of the subdivision graph and the line graph of subdivision graph of the wheel graph
Topological index is a useful number associated with molecular graph and the number correlate certain physico-chemical properties of chemical compounds. The concept of line graph and subdivision graph for a graph G has found various applications in chemical research. In this paper, we compute the first, second, and third Zagreb coindices, the F-coindex, the first and second multiplicative Zagreb coindices and the hyper Zagreb coindex of the subdivision graph and the line graph of subdivision graph of the wheel graph.
- 17 February 2021
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 24 (2) , 589-601
Topological indices of the subdivision graph and the line graph of subdivision graph of the wheel graph
Topological index is a useful number associated with molecular graph and the number correlate certain physico-chemical properties of chemical compounds. The concept of line graph and subdivision graph for a graph G has found various applications in chemical research. In this paper, we compute the first, second, and third Zagreb coindices, the F-coindex, the first and second multiplicative Zagreb coindices and the hyper Zagreb coindex of the subdivision graph and the line graph of subdivision graph of the wheel graph.
- 4 February 2021
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 50 (1) , 33-40
Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices
For $ \alpha \in [0,1]$, let $A_{\alpha}(G) = \alpha D(G) +(1-\alpha)A(G)$ be $A_{\alpha}$-matrix, where $A(G)$ is the adjacent matrix and $D(G)$ is the diagonal matrix of the degrees of a graph $G$. Clearly, $A_{0} (G)$ is the adjacent matrix and $2 A_{\frac{1}{2}}$ is the signless Laplacian matrix. A connected graph is a cactus graph if any two cycles of $G$ have at most one common vertex, which is an extension of the tree. We first propose the result for subdivision graphs, and determine the cacti maximizing $A_{\alpha}$-spectral radius subject to fixed pendant vertices. In addition, the corresponding extremal graphs are provided. As consequences, we determine the graph with the $A_{\alpha}$-spectral radius among all the cacti with $n$ vertices; we also characterize the $n$-vertex cacti with a perfect matching having the largest $A_{\alpha}$-spectral radius.- 4 February 2021
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 50 (1) , 33-40
Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices
For $ \alpha \in [0,1]$, let $A_{\alpha}(G) = \alpha D(G) +(1-\alpha)A(G)$ be $A_{\alpha}$-matrix, where $A(G)$ is the adjacent matrix and $D(G)$ is the diagonal matrix of the degrees of a graph $G$. Clearly, $A_{0} (G)$ is the adjacent matrix and $2 A_{\frac{1}{2}}$ is the signless Laplacian matrix. A connected graph is a cactus graph if any two cycles of $G$ have at most one common vertex, which is an extension of the tree. We first propose the result for subdivision graphs, and determine the cacti maximizing $A_{\alpha}$-spectral radius subject to fixed pendant vertices. In addition, the corresponding extremal graphs are provided. As consequences, we determine the graph with the $A_{\alpha}$-spectral radius among all the cacti with $n$ vertices; we also characterize the $n$-vertex cacti with a perfect matching having the largest $A_{\alpha}$-spectral radius.- Open Access
- 1 July 2020
- Published by Walter de Gruyter GmbH in Applied Mathematics and Nonlinear Sciences
- Vol. 5 (2) , 109-120
The first general Zagreb coindex of graph operations
Many chemically important graphs can be obtained from simpler graphs by applying different graph operations. Graph operations such as union, sum, Cartesian product, composition and tensor product of graphs are among the important ones. In this paper, we introduce a new invariant which is named as the first general Zagreb coindex and defined as M ¯ 1 α ( G ) = ∑ uv ∈ E ( G ¯ ) [ d G ( u ) α + d G ( v ) α ] \overline{M}^\alpha_1(G)=\Sigma_{uv\in E(\overline{G})}[d_G(u)^\alpha+d_G(v)^\alpha] , where α ∈ ℝ, α ≠ 0. Here, we study the basic properties of the newly introduced invariant and its behavior under some graph operations such as union, sum, Cartesian product, composition and tensor product of graphs and hence apply the results to find the first general Zagreb coindex of different important nano-structures and molecular graphs.
- 1 July 2020
- Published by Walter de Gruyter GmbH in Applied Mathematics and Nonlinear Sciences
- Vol. 5 (2) , 109-120
Open AccessThe first general Zagreb coindex of graph operations
Many chemically important graphs can be obtained from simpler graphs by applying different graph operations. Graph operations such as union, sum, Cartesian product, composition and tensor product of graphs are among the important ones. In this paper, we introduce a new invariant which is named as the first general Zagreb coindex and defined as M ¯ 1 α ( G ) = ∑ uv ∈ E ( G ¯ ) [ d G ( u ) α + d G ( v ) α ] \overline{M}^\alpha_1(G)=\Sigma_{uv\in E(\overline{G})}[d_G(u)^\alpha+d_G(v)^\alpha] , where α ∈ ℝ, α ≠ 0. Here, we study the basic properties of the newly introduced invariant and its behavior under some graph operations such as union, sum, Cartesian product, composition and tensor product of graphs and hence apply the results to find the first general Zagreb coindex of different important nano-structures and molecular graphs.
- Open Access
- 28 May 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (6) , 869
On the Aα-Spectral Radii of Cactus Graphs
Let be the adjacent matrix and the diagonal matrix of the degrees of a graph G, respectively. For , the -matrix is the general adjacency and signless Laplacian spectral matrix having the form of . Clearly, is the adjacent matrix and is the signless Laplacian matrix. A cactus is a connected graph such that any two of its cycles have at most one common vertex, that is an extension of the tree. The -spectral radius of a cactus graph with n vertices and k cycles is explored. The outcomes obtained in this paper can imply some previous bounds from trees to cacti. In addition, the corresponding extremal graphs are determined. Furthermore, we proposed all eigenvalues of such extremal cacti. Our results extended and enriched previous known results.- 28 May 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (6) , 869
Open AccessOn the Aα-Spectral Radii of Cactus Graphs
Let be the adjacent matrix and the diagonal matrix of the degrees of a graph G, respectively. For , the -matrix is the general adjacency and signless Laplacian spectral matrix having the form of . Clearly, is the adjacent matrix and is the signless Laplacian matrix. A cactus is a connected graph such that any two of its cycles have at most one common vertex, that is an extension of the tree. The -spectral radius of a cactus graph with n vertices and k cycles is explored. The outcomes obtained in this paper can imply some previous bounds from trees to cacti. In addition, the corresponding extremal graphs are determined. Furthermore, we proposed all eigenvalues of such extremal cacti. Our results extended and enriched previous known results. - Open Access
- 1 July 2019
- Published by Walter de Gruyter GmbH in Applied Mathematics and Nonlinear Sciences
- Vol. 4 (2) , 455-468
Computation of certain topological coindices of graphene sheet and C 4 C 8 ( S ) nanotubes and nanotorus
Topological indices are widely used for quantitative structure-activity relationship (QSAR) and quantitative structure-property relationship (QSPR). Topological coindices are topological indices that considers the non adjacent pairs of vertices. Here, we consider the following five well-known topological coindices: the first and second Zagreb coindices, the first and second multiplicative Zagreb coindices and the F -coindex. By using graph structural analysis and derivation, we study the above-mentioned topological coindices of some chemical molecular graphs that frequently appear in medical, chemical, and material engineering such as graphene sheet and C 4 C 8 ( S ) nanotubes and nanotorus and obtain the computation formulae of the coindices of these graphs. Furthermore, we analyze the results by MATLAB and obtain the relationship of the coindices which they describe the physcio-chemical properties and biological activities.
- 1 July 2019
- Published by Walter de Gruyter GmbH in Applied Mathematics and Nonlinear Sciences
- Vol. 4 (2) , 455-468
Open AccessComputation of certain topological coindices of graphene sheet and C 4 C 8 ( S ) nanotubes and nanotorus
Topological indices are widely used for quantitative structure-activity relationship (QSAR) and quantitative structure-property relationship (QSPR). Topological coindices are topological indices that considers the non adjacent pairs of vertices. Here, we consider the following five well-known topological coindices: the first and second Zagreb coindices, the first and second multiplicative Zagreb coindices and the F -coindex. By using graph structural analysis and derivation, we study the above-mentioned topological coindices of some chemical molecular graphs that frequently appear in medical, chemical, and material engineering such as graphene sheet and C 4 C 8 ( S ) nanotubes and nanotorus and obtain the computation formulae of the coindices of these graphs. Furthermore, we analyze the results by MATLAB and obtain the relationship of the coindices which they describe the physcio-chemical properties and biological activities.
- Open Access
- 4 January 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (1) , 44
The Aα-Spectral Radii of Graphs with Given Connectivity
The -matrix is with , given by Nikiforov in 2017, where is adjacent matrix, and is its diagonal matrix of the degrees of a graph G. The maximal eigenvalue of is said to be the -spectral radius of G. In this work, we determine the graphs with largest -spectral radius with fixed vertex or edge connectivity. In addition, related extremal graphs are characterized and equations satisfying -spectral radius are proposed.- 4 January 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (1) , 44
Open AccessThe Aα-Spectral Radii of Graphs with Given Connectivity
The -matrix is with , given by Nikiforov in 2017, where is adjacent matrix, and is its diagonal matrix of the degrees of a graph G. The maximal eigenvalue of is said to be the -spectral radius of G. In this work, we determine the graphs with largest -spectral radius with fixed vertex or edge connectivity. In addition, related extremal graphs are characterized and equations satisfying -spectral radius are proposed. - Open Access
- 29 October 2018
- Published by MDPI AG in Mathematics
- Vol. 6 (11) , 227
Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges
Given a (molecular) graph, the first multiplicative Zagreb index is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in are provided. We also provide these graphs with the largest and smallest and in .- 29 October 2018
- Published by MDPI AG in Mathematics
- Vol. 6 (11) , 227
Open AccessMaximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges
Given a (molecular) graph, the first multiplicative Zagreb index is considered to be the product of squares of the degree of its vertices, while the second multiplicative Zagreb index is expressed as the product of endvertex degree of each edge over all edges. We consider a set of graphs having n vertices and k cut edges, and explore the graphs subject to a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs in are provided. We also provide these graphs with the largest and smallest and in . - Open Access
- 1 July 2018
- Published by Erdos Publish House in Applied Mathematics and Nonlinear Sciences
- Vol. 3 (2) , 419-426
Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs
The product graph G m *G p of two given graphs G m and G p , defined by J.C. Bermond et al.[J Combin Theory, Series B 36(1984) 32-48] in the context of the so-called ( Δ,D )-problem, is one interesting model in the design of large reliable networks. This work deals with sufficient conditions that guarantee these product graphs to be hamiltonian-connected. Moreover, we state product graphs for which provide panconnectivity of interconnection networks modeled by a product of graphs with faulty elements.
- 1 July 2018
- Published by Erdos Publish House in Applied Mathematics and Nonlinear Sciences
- Vol. 3 (2) , 419-426
Open AccessHamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs
The product graph G m *G p of two given graphs G m and G p , defined by J.C. Bermond et al.[J Combin Theory, Series B 36(1984) 32-48] in the context of the so-called ( Δ,D )-problem, is one interesting model in the design of large reliable networks. This work deals with sufficient conditions that guarantee these product graphs to be hamiltonian-connected. Moreover, we state product graphs for which provide panconnectivity of interconnection networks modeled by a product of graphs with faulty elements.