Huishu Lian

Huishu Lian

Auto-generated profile, based on publicly available information

Huishu Lian

College of Science China University of Mining and Technology 221116 Xuzhou P.R. China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 October 2013 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
AAA. Anuradha
A. Anuradha
RBR. Balakrishnan
R. Balakrishnan
XCXiaolin Chen
Xiaolin Chen
Xueliang LiXueliang Li
Xueliang Li
HLHuishu Lian
Huishu Lian
WSWasin So
Wasin So
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.

18 May 2012 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
LCLily Chen
Lily Chen
Xueliang LiXueliang Li
Xueliang Li
HLHuishu Lian
Huishu Lian

1 October 2020 in Acta Mathematicae Applicatae Sinica, English Series
Verified
Journal Article
Closed access
PDF file
XCXiao-Lin Chen
Xiao-Lin Chen
XLXue-Liang Li
Xue-Liang Li
HLHui-Shu Lian
Hui-Shu Lian

6 June 2023 in Journal of Graph Theory
Verified
Journal Article
Closed access
XCXiaolin Chen
Xiaolin Chen
GWGuangbiao Wei
Guangbiao Wei
HLHuishu Lian
Huishu Lian

1 January 2019 in Complexity
Verified
Journal Article
Open access
XCXiaolin Chen
Xiaolin Chen
HLHuishu Lian
Huishu Lian
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).

7 January 2013 in arXiv
Verified
Preprint
Open access
PDF file
XCXiaolin Chen
Xiaolin Chen
Xueliang LiXueliang Li
Xueliang Li
HLHuishu Lian
Huishu Lian
The \emph{spanning tree packing number} of a graph $G$ is the maximum number of edge-disjoint spanning trees contained in $G$. Let $k\geq 1$ be a fixed integer. Palmer and Spencer proved that in almost every random graph process, the hitting time for having $k$ edge-disjoint spanning trees equals the hitting time for having minimum degree $k$. In this paper, we prove that for any $p$ such that $(\log n+\omega(1))/n\leq p\leq (1.1\log n)/n$, almost surely the random graph $G(n,p)$ satisfies that the spanning tree packing number is equal to the minimum degree. Note that this bound for $p$ will allow the minimum degree to be a function of $n$, and in this sense we improve the result of Palmer and Spencer. Moreover, we also obtain that for any $p$ such that $p\geq (51\log n)/n$, almost surely the random graph $G(n,p)$ satisfies that the spanning tree packing number is less than the minimum degree.