Kang Liying

Kang Liying


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
23 March 2022 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
DDDheer Noal Desai
Dheer Noal Desai
KLKang Liying
Kang Liying
YLYongtao Li
Yongtao Li
ZNZhenyu Ni
Zhenyu Ni
MTMichael Tait
Michael Tait
JWJing Wang
Jing Wang

13 May 2011 in Theoretical Computer Science
Verified
Journal Article
Closed access
YZYancai Zhao
Yancai Zhao
KLKang Liying
Kang Liying
MSMoo Young Sohn
Moo Young Sohn

13 January 2023 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
ZNZhenyu Ni
Zhenyu Ni
JWJing Wang
Jing Wang
KLKang Liying
Kang Liying
Let $kK_{r+1}$ be the graph consisting of $k$ vertex-disjoint copies of the complete graph $K_{r+1}$. Moon [Canad. J. Math. 20 (1968) 95--102] and Simonovits [Theory of Graphs (Proc. colloq., Tihany, 1996)] independently showed that if $n$ is sufficiently large, then the join of a complete graph $K_{k-1}$ and an $r$-partite Turán graph $T_{n-k+1,r}$ is the unique extremal graph for $kK_{r+1}$. In this paper we consider the graph which has the maximum spectral radius among all graphs without $k$ disjoint cliques. We show that if $G$ attains the maximum spectral radius over all $n$-vertex $kK_{r+1}$-free graphs for sufficiently large $n$, then $G$ is isomorphic to the join of a complete graph $K_{k-1}$ and an $r$-partite Turán graph $T_{n-k+1,r}$.

5 October 2018 in The Electronic Journal of Combinatorics
Verified
Journal Article
Closed access
PDF file
LSLi Su
Li Su
KLKang Liying
Kang Liying
HLHonghai Li
Honghai Li
ESErfang Shan
Erfang Shan
We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results on grafting operations on graphs to supertrees. Using the methods of grafting operations on supertrees and comparing matching polynomials of supertrees, we determine the first $\lfloor\frac{d}{2}\rfloor+1$ largest spectral radii of $r$-uniform supertrees with size $m$ and diameter $d$. In addition, the first two smallest spectral radii of supertrees with size $m$ are determined.

6 March 2014 in BioMed Research International
Verified
Journal Article
Open access
PDF file
SLShan Li
Shan Li
KLKang Liying
Kang Liying
XZXing-Ming Zhao
Xing-Ming Zhao
With the rapid advance in genomics, proteomics, metabolomics, and other types of omics technologies during the past decades, a tremendous amount of data related to molecular biology has been produced. It is becoming a big challenge for the bioinformatists to analyze and interpret these data with conventional intelligent techniques, for example, support vector machines. Recently, the hybrid intelligent methods, which integrate several standard intelligent approaches, are becoming more and more popular due to their robustness and efficiency. Specifically, the hybrid intelligent approaches based on evolutionary algorithms (EAs) are widely used in various fields due to the efficiency and robustness of EAs. In this review, we give an introduction about the applications of hybrid intelligent methods, in particular those based on evolutionary algorithm, in bioinformatics. In particular, we focus on their applications to three common problems that arise in bioinformatics, that is, feature selection, parameter estimation, and reconstruction of biological networks.

1 April 2019 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
LLLele Liu
Lele Liu
KLKang Liying
Kang Liying
SBShuliang Bai
Shuliang Bai