Huishu Lian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Huishu Lian has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Xueliang Li
Center for Combinatorics and LPMC, Nankai University, Tianjin, China
14 shared publications - Xiaolin Chen
Center for Combinatorics and LPMC TJKLC Nankai University 300071 Tianjin P.R. China
9 shared publications - Lily Chen
School of Mathematical Sciences, Huaqiao University, Quanzhou, China
3 shared publications Xiaolin Chen
Department of Mathematics China University of Mining and Technology Xuzhou China
2 shared publications- A. Anuradha
Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur 603203, Tamil Nadu, India
1 shared publication Guangbiao Wei
Department of Mathematics China University of Mining and Technology Xuzhou China
1 shared publication
Latest Publications
- 6 June 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (3) , 645-658
Solution to a conjecture on the mean subtree order of graphs under edge addition
The mean subtree order of a graph is the number of vertices of all subtrees of this graph divided by the number of all subtrees of this graph. In 2021, Cameron and Mol constructed a special graph of order and proved that the addition of a single edge between a pair of nonadjacent vertices in the graph can decrease the mean subtree order by as much as when is large enough. Moreover, they left a conjecture that for every positive integer , there exists a graph obtained by adding edges to another graph , then the mean subtree order of is more than that of . In this paper, we confirm this conjecture.
- 6 June 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (3) , 645-658
Solution to a conjecture on the mean subtree order of graphs under edge addition
The mean subtree order of a graph is the number of vertices of all subtrees of this graph divided by the number of all subtrees of this graph. In 2021, Cameron and Mol constructed a special graph of order and proved that the addition of a single edge between a pair of nonadjacent vertices in the graph can decrease the mean subtree order by as much as when is large enough. Moreover, they left a conjecture that for every positive integer , there exists a graph obtained by adding edges to another graph , then the mean subtree order of is more than that of . In this paper, we confirm this conjecture.
- 1 October 2020
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 36 (4) , 879-890
Rainbow k-connectivity of Random Bipartite Graphs
- 1 October 2020
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 36 (4) , 879-890
Rainbow k-connectivity of Random Bipartite Graphs
- Open Access
- 1 January 2019
- Published by Wiley in Complexity
- Vol. 2019 (1)
Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
The matching energy ME(G) of a graph G was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial m(G, x). The largest matching root λ1(G) is the largest root of the matching polynomial m(G, x). Let denote the complete r‐partite graph with order n = n1 + n2 + …+nr, where r > 1. In this paper, we prove that, for the given values n and r, both the matching energy ME(G) and the largest matching root λ1(G) of complete r‐partite graphs are minimal for complete split graph CS(n, r − 1) and are maximal for Turán graph T(n, r).
- 1 January 2019
- Published by Wiley in Complexity
- Vol. 2019 (1)
Open AccessExtremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
The matching energy ME(G) of a graph G was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial m(G, x). The largest matching root λ1(G) is the largest root of the matching polynomial m(G, x). Let denote the complete r‐partite graph with order n = n1 + n2 + …+nr, where r > 1. In this paper, we prove that, for the given values n and r, both the matching energy ME(G) and the largest matching root λ1(G) of complete r‐partite graphs are minimal for complete split graph CS(n, r − 1) and are maximal for Turán graph T(n, r).
- Open Access
A survey on the skew energy of oriented graphs
Let $G$ be a simple undirected graph with adjacency matrix $A(G)$. The energy of $G$ is defined as the sum of absolute values of all eigenvalues of $A(G)$, which was introduced by Gutman in 1970s. Since graph energy has important chemical applications, it causes great concern and has many generalizations. The skew energy and skew energy-like are the generalizations in oriented graphs. Let $G^\sigma$ be an oriented graph of $G$ with skew adjacency matrix $S(G^\sigma)$. The skew energy of $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the norms of all eigenvalues of $S(G^\sigma)$, which was introduced by Adiga, Balakrishnan and So in 2010. In this paper, we summarize main results on the skew energy of oriented graphs. Some open problems are proposed for further study. Besides, results on the skew energy-like: the skew Laplacian energy and skew Randi\'{c} energy are also surveyed at the end.Open AccessA survey on the skew energy of oriented graphs
Let $G$ be a simple undirected graph with adjacency matrix $A(G)$. The energy of $G$ is defined as the sum of absolute values of all eigenvalues of $A(G)$, which was introduced by Gutman in 1970s. Since graph energy has important chemical applications, it causes great concern and has many generalizations. The skew energy and skew energy-like are the generalizations in oriented graphs. Let $G^\sigma$ be an oriented graph of $G$ with skew adjacency matrix $S(G^\sigma)$. The skew energy of $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the norms of all eigenvalues of $S(G^\sigma)$, which was introduced by Adiga, Balakrishnan and So in 2010. In this paper, we summarize main results on the skew energy of oriented graphs. Some open problems are proposed for further study. Besides, results on the skew energy-like: the skew Laplacian energy and skew Randi\'{c} energy are also surveyed at the end. - Open Access
The matching energy of random graphs
The matching energy of a graph was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial of the graph. For the random graph $G_{n,p}$ of order $n$ with fixed probability $p\in (0,1)$, Gutman and Wagner [I. Gutman, S. Wagner, The matching energy of a graph, Discrete Appl. Math. 160(2012), 2177--2187] proposed a conjecture that the matching energy of $G_{n,p}$ converges to $\frac{8\sqrt{p}}{3\pi}n^{\frac{3}{2}}$ almost surely. In this paper, using analysis method, we prove that the conjecture is true.Open AccessThe matching energy of random graphs
The matching energy of a graph was introduced by Gutman and Wagner, which is defined as the sum of the absolute values of the roots of the matching polynomial of the graph. For the random graph $G_{n,p}$ of order $n$ with fixed probability $p\in (0,1)$, Gutman and Wagner [I. Gutman, S. Wagner, The matching energy of a graph, Discrete Appl. Math. 160(2012), 2177--2187] proposed a conjecture that the matching energy of $G_{n,p}$ converges to $\frac{8\sqrt{p}}{3\pi}n^{\frac{3}{2}}$ almost surely. In this paper, using analysis method, we prove that the conjecture is true. - Open Access
Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\sigma$ is the same for every orientation $\sigma$ of $G$, and equals the maximum matching root of $G$. They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs $G$ of order $n$ are isomorphic to the odd-cycle graph with one vertex degree $n-1$ and size $m=\lfloor 3(n-1)/2\rfloor$. This paper, by using the Kelmans transformation, gives a proof of the conjecture. Moreover, sharp upper bounds of the maximum matching roots of the odd-cycle graphs with given order $n$ and size $m$ are given and extremal graphs are characterized.Open AccessSolution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\sigma$ is the same for every orientation $\sigma$ of $G$, and equals the maximum matching root of $G$. They proposed a conjecture that the graphs which attain the maximum skew spectral radius among the odd-cycle graphs $G$ of order $n$ are isomorphic to the odd-cycle graph with one vertex degree $n-1$ and size $m=\lfloor 3(n-1)/2\rfloor$. This paper, by using the Kelmans transformation, gives a proof of the conjecture. Moreover, sharp upper bounds of the maximum matching roots of the odd-cycle graphs with given order $n$ and size $m$ are given and extremal graphs are characterized. - Open Access
Lower bounds of the skew spectral radii and skew energy of oriented graphs
Let $G$ be a graph with maximum degree $\Delta$, and let $G^{\sigma}$ be an oriented graph of $G$ with skew adjacency matrix $S(G^{\sigma})$. The skew spectral radius $\rho_s(G^{\sigma})$ of $G^\sigma$ is defined as the spectral radius of $S(G^\sigma)$. The skew spectral radius has been studied, but only few results about its lower bound are known. This paper determines some lower bounds of the skew spectral radius, and then studies the oriented graphs whose skew spectral radii attain the lower bound $\sqrt{\Delta}$. Moreover, we apply the skew spectral radius to the skew energy of oriented graphs, which is defined as the sum of the norms of all the eigenvalues of $S(G^\sigma)$, and denoted by $\mathcal{E}_s(G^\sigma)$. As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al.Open AccessLower bounds of the skew spectral radii and skew energy of oriented graphs
Let $G$ be a graph with maximum degree $\Delta$, and let $G^{\sigma}$ be an oriented graph of $G$ with skew adjacency matrix $S(G^{\sigma})$. The skew spectral radius $\rho_s(G^{\sigma})$ of $G^\sigma$ is defined as the spectral radius of $S(G^\sigma)$. The skew spectral radius has been studied, but only few results about its lower bound are known. This paper determines some lower bounds of the skew spectral radius, and then studies the oriented graphs whose skew spectral radii attain the lower bound $\sqrt{\Delta}$. Moreover, we apply the skew spectral radius to the skew energy of oriented graphs, which is defined as the sum of the norms of all the eigenvalues of $S(G^\sigma)$, and denoted by $\mathcal{E}_s(G^\sigma)$. As results, we obtain some lower bounds of the skew energy, which improve the known lower bound obtained by Adiga et al. - Open Access
- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P18
Skew Spectra of Oriented Bipartite Graphs
A graph $G$ is said to have a parity-linked orientation $\phi$ if every even cycle $C_{2k}$ in $G^{\phi}$ is evenly (resp. oddly) oriented whenever $k$ is even (resp. odd). In this paper, this concept is used to provide an affirmative answer to the following conjecture of D. Cui and Y. Hou [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, Electronic J. Combin. 20(2):#P19, 2013]: Let $G=G(X,Y)$ be a bipartite graph. Call the $X\rightarrow Y$ orientation of $G,$ the canonical orientation. Let $\phi$ be any orientation of $G$ and let $Sp_S(G^{\phi})$ and $Sp(G)$ denote respectively the skew spectrum of $G^{\phi}$ and the spectrum of $G.$ Then $Sp_S(G^{\phi}) = {\bf{i}} Sp(G)$ if and only if $\phi$ is switching-equivalent to the canonical orientation of $G.$ Using this result, we determine the switch for a special family of oriented hypercubes $Q_d^{\phi},$ $d\geq 1.$ Moreover, we give an orientation of the Cartesian product of a bipartite graph and a graph, and then determine the skew spectrum of the resulting oriented product graph, which generalizes a result of Cui and Hou. Further this can be used to construct new families of oriented graphs with maximum skew energy.- 14 October 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P18
Open AccessSkew Spectra of Oriented Bipartite Graphs
A graph $G$ is said to have a parity-linked orientation $\phi$ if every even cycle $C_{2k}$ in $G^{\phi}$ is evenly (resp. oddly) oriented whenever $k$ is even (resp. odd). In this paper, this concept is used to provide an affirmative answer to the following conjecture of D. Cui and Y. Hou [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, Electronic J. Combin. 20(2):#P19, 2013]: Let $G=G(X,Y)$ be a bipartite graph. Call the $X\rightarrow Y$ orientation of $G,$ the canonical orientation. Let $\phi$ be any orientation of $G$ and let $Sp_S(G^{\phi})$ and $Sp(G)$ denote respectively the skew spectrum of $G^{\phi}$ and the spectrum of $G.$ Then $Sp_S(G^{\phi}) = {\bf{i}} Sp(G)$ if and only if $\phi$ is switching-equivalent to the canonical orientation of $G.$ Using this result, we determine the switch for a special family of oriented hypercubes $Q_d^{\phi},$ $d\geq 1.$ Moreover, we give an orientation of the Cartesian product of a bipartite graph and a graph, and then determine the skew spectrum of the resulting oriented product graph, which generalizes a result of Cui and Hou. Further this can be used to construct new families of oriented graphs with maximum skew energy. - Open Access
Skew-spectra and skew energy of various products of graphs
Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. Then the spectrum of $S(G^\sigma)$ consisting of all the eigenvalues of $S(G^\sigma)$ is called the skew-spectrum of $G^\sigma$, denoted by $Sp(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the norms of all the eigenvalues of $S(G^\sigma)$. In this paper, we give orientations of the Kronecker product $H\otimes G$ and the strong product $H\ast G$ of $H$ and $G$ where $H$ is a bipartite graph and $G$ is an arbitrary graph. Then we determine the skew-spectra of the resultant oriented graphs. As applications, we construct new families of oriented graphs with maximum skew energy. Moreover, we consider the skew energy of the orientation of the lexicographic product $H[G]$ of a bipartite graph $H$ and a graph $G$.Open AccessSkew-spectra and skew energy of various products of graphs
Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. Then the spectrum of $S(G^\sigma)$ consisting of all the eigenvalues of $S(G^\sigma)$ is called the skew-spectrum of $G^\sigma$, denoted by $Sp(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$, is defined as the sum of the norms of all the eigenvalues of $S(G^\sigma)$. In this paper, we give orientations of the Kronecker product $H\otimes G$ and the strong product $H\ast G$ of $H$ and $G$ where $H$ is a bipartite graph and $G$ is an arbitrary graph. Then we determine the skew-spectra of the resultant oriented graphs. As applications, we construct new families of oriented graphs with maximum skew energy. Moreover, we consider the skew energy of the orientation of the lexicographic product $H[G]$ of a bipartite graph $H$ and a graph $G$. - Open Access
More on the skew-spectra of bipartite graphs and Cartesian products of graphs
Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. Then the spectrum of $S(G^\sigma)$ is called the skew-spectrum of $G^\sigma$, denoted by $Sp_S(G^\sigma)$. It is known that a graph $G$ is bipartite if and only if there is an orientation $\sigma$ of $G$ such that $Sp_S(G^\sigma)=iSp(G)$. In [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, Electron. J. Combin. 20(2013), #P19], Cui and Hou conjectured that such orientation of a bipartite graph is unique under switching-equivalence. In this paper, we prove that the conjecture is true. Moreover, we give an orientation of the Cartesian product of a bipartite graph and a graph, and then determine the skew-spectrum of the resulting oriented product graph, which generalizes Cui and Hou's result, and can be used to construct more oriented graphs with maximum skew energy.Open AccessMore on the skew-spectra of bipartite graphs and Cartesian products of graphs
Given a graph $G$, let $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. Then the spectrum of $S(G^\sigma)$ is called the skew-spectrum of $G^\sigma$, denoted by $Sp_S(G^\sigma)$. It is known that a graph $G$ is bipartite if and only if there is an orientation $\sigma$ of $G$ such that $Sp_S(G^\sigma)=iSp(G)$. In [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, Electron. J. Combin. 20(2013), #P19], Cui and Hou conjectured that such orientation of a bipartite graph is unique under switching-equivalence. In this paper, we prove that the conjecture is true. Moreover, we give an orientation of the Cartesian product of a bipartite graph and a graph, and then determine the skew-spectrum of the resulting oriented product graph, which generalizes Cui and Hou's result, and can be used to construct more oriented graphs with maximum skew energy.