default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi-Zheng Fan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Yi-Min Song, Yi-Zheng Fan
, Yi Wang, Meng-Yu Tian, Jiang-Chao Wan:
The spectral property of hypergraph coverings. Discret. Math. 347(3): 113830 (2024)- [j37]Yi-Zheng Fan, Jian Zheng, Ya Yang:
The trace of uniform hypergraphs with application to Estrada index. Discret. Math. Algorithms Appl. 16(5): 2350065:1-2350065:31 (2024) - [j36]Yi-Zheng Fan, Hong-Xia Yang, Jian Zheng:
High-ordered spectral characterization of unicyclic graphs. Discuss. Math. Graph Theory 44(3): 1107 (2024) - [i4]Saieed Akbari, Yi-Zheng Fan, Fu-Tao Hu, Babak Miraftab, Yi Wang:
Spectral Methods for Matrix Product Factorization. CoRR abs/2407.04150 (2024) - 2022
- [j35]Yi-Zheng Fan, Meng-Yu Tian, Min Li:
The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs. J. Comb. Theory A 185: 105537 (2022) - 2021
- [j34]Yi-Zheng Fan, Min Li, Yi Wang:
The cyclic index of adjacency tensor of generalized power hypergraphs. Discret. Math. 344(5): 112329 (2021) - [j33]Shuangdong Li, Yi-Zheng Fan, Tatsuro Ito, Masoud Karimi, Jing Xu:
The isomorphism problem of trees from the viewpoint of Terwilliger algebras. J. Comb. Theory A 177: 105328 (2021) - 2020
- [j32]Yi-Zheng Fan, Yi Wang, Jiang-Chao Wan:
Minimal Non-Odd-Transversal Hypergraphs and Minimal Non-Odd-Bipartite Hypergraphs. Electron. J. Comb. 27(4): 4 (2020) - [j31]Jiang-Chao Wan, Yi-Zheng Fan, Yi Wang:
The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs. Discret. Math. 343(9): 111987 (2020)
2010 – 2019
- 2019
- [j30]Gaixiang Cai, Yi-Zheng Fan, Yi Fang, Gui-Dong Yu:
Spectral radius and Hamiltonicity of graphs. Discuss. Math. Graph Theory 39(4): 951-974 (2019) - [j29]Ying-Ying Tan, Yi-Zheng Fan, Tatsuro Ito, Xiaoye Liang:
The Terwilliger algebra of the Johnson scheme J(N, D) revisited from the viewpoint of group representations. Eur. J. Comb. 80: 157-171 (2019) - 2018
- [j28]Yi Wang, Shi-Cai Gong, Yi-Zheng Fan:
On the determinant of the Laplacian matrix of a complex unit gain graph. Discret. Math. 341(1): 81-86 (2018) - 2017
- [j27]Gui-Dong Yu, Yi-Zheng Fan, Miaolin Ye:
The least signless Laplacian eignvalue of the complements of unicyclic graphs. Appl. Math. Comput. 306: 13-21 (2017) - 2016
- [j26]Jing Xu, Yi-Zheng Fan, Ying-Ying Tan:
Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number. Ars Comb. 125: 361-370 (2016) - [j25]Murad-ul-Islam Khan, Yi-Zheng Fan, Ying-Ying Tan:
The H-spectra of a class of generalized power hypergraphs. Discret. Math. 339(6): 1682-1689 (2016) - [j24]Yi-Zheng Fan, An-Hong Liu, Xi-Xi Peng, Ying-Ying Tan:
Maximizing spectral radii of uniform hypergraphs with few edges. Discuss. Math. Graph Theory 36(4): 845-856 (2016) - 2015
- [j23]Long Wang, Yi-Zheng Fan, Yi Wang:
Maximum Estrada index of bicyclic graphs. Discret. Appl. Math. 180: 194-199 (2015) - [j22]Xiao-Xin Li, Yi-Zheng Fan:
The connectivity and the Harary index of a graph. Discret. Appl. Math. 181: 167-173 (2015) - [j21]Yi-Zheng Fan, Xiao-Xin Li, Yi Wang, Feifei Zhang:
The least eigenvalue of graphs whose complements are unicyclic. Discuss. Math. Graph Theory 35(2): 249-260 (2015) - [j20]Zhen-Mu Hong, Yi-Zheng Fan:
The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges. Graphs Comb. 31(5): 1473-1485 (2015) - 2014
- [j19]Yi-Zheng Fan, Ying-Ying Tan:
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number. Discret. Math. 334: 20-25 (2014) - 2013
- [j18]Yi-Zheng Fan, Yi Wang, Huan Guo:
The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices. Discret. Math. 313(7): 903-909 (2013) - [i3]Yi-Zheng Fan, Tao Huang, Ming Zhu:
Mixed Compressed Sensing Based on Random Graphs. CoRR abs/1307.2117 (2013) - [i2]Tao Huang, Yi-Zheng Fan, Ming Zhu:
Symmetric Toeplitz-Structured Compressed Sensing Matrices. CoRR abs/1308.2027 (2013) - 2012
- [j17]Song Liu, Xiaoyan Li, Wei Jiang, Yi-Zheng Fan:
Adaptive synchronization in complex dynamical networks with coupling delays for general graphs. Appl. Math. Comput. 219(1): 83-87 (2012) - [j16]Yi-Zheng Fan, Gui-Dong Yu, Yi Wang:
The Chromatic Number and the Least Eigenvalue of a Graph. Electron. J. Comb. 19(1): 39 (2012) - [j15]Yi Wang, Yi-Zheng Fan:
The Least Eigenvalue of Graphs with Cut Edges. Graphs Comb. 28(4): 555-561 (2012) - [i1]Yi-Zheng Fan, Tao Huang, Ming Zhu:
Compressed Sensing Based on Random Symmetric Bernoulli Matrix. CoRR abs/1212.3799 (2012) - 2011
- [j14]Yi-Zheng Fan, Jing-Mei Zhang, Yi Wang:
Spectral radii of unicyclic Graphs with Fixed Number of Cut vertices. Discret. Math. Algorithms Appl. 3(2): 139-146 (2011) - 2010
- [j13]Lin Cui, Yi-Zheng Fan:
The signless Laplacian spectral radius of graphs with given number of cut vertices. Discuss. Math. Graph Theory 30(1): 85-93 (2010)
2000 – 2009
- 2009
- [j12]Yan-Hong Bao, Ying-Ying Tan, Yi-Zheng Fan:
The Laplacian spread of unicyclic graphs. Appl. Math. Lett. 22(7): 1011-1015 (2009) - [j11]Yi-Zheng Fan, Shi-Cai Gong, Yi Wang, Yu-Bin Gao:
First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph. Discret. Math. 309(8): 2479-2487 (2009) - [j10]Yi-Zheng Fan, Dan Yang:
The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices. Graphs Comb. 25(3): 291-298 (2009) - 2008
- [j9]Yi-Zheng Fan, Song Wu:
Order unicyclic graphs according to spetral radius of unoriented Laplacian matrix. Discuss. Math. Graph Theory 28(3): 487-499 (2008) - [j8]Yi-Zheng Fan, Jing Xu, Yi Wang, Dong Liang:
The Laplacian Spread of a Tree. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - 2007
- [j7]Yi-Zheng Fan, Haiyan Hong, Shi-Cai Gong, Yi Wang:
Order unicyclic mixed graphs by spectral radius. Australas. J Comb. 37: 305- (2007) - [j6]Yi-Zheng Fan, Shi-Cai Gong:
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two. Discuss. Math. Graph Theory 27(1): 69-82 (2007) - [j5]Yi-Zheng Fan, Yi Wang, Jun Zhou:
On the second largest eigenvalue of a mixed graph. Discuss. Math. Graph Theory 27(2): 373-384 (2007) - [j4]Yi-Zheng Fan, Shi-Cai Gong, Jun Zhou, Ying-Ying Tan, Yi Wang:
Nonsingular mixed graphs with few eigenvalues greater than two. Eur. J. Comb. 28(6): 1694-1702 (2007) - [j3]Jun Tang, Dong Liang, Nian Wang, Yi-Zheng Fan:
A Laplacian spectral method for stereo correspondence. Pattern Recognit. Lett. 28(12): 1391-1399 (2007) - [c2]Jun Tang, Nian Wang, Dong Liang, Yi-Zheng Fan, Zhao-Hong Jia:
Spectral Correspondence Using the TPS Deformation Model. ISNN (1) 2007: 572-581 - [c1]Nian Wang, Jun Tang, Jiang Zhang, Yi-Zheng Fan, Dong Liang:
Spectral Edit Distance Method for Image Clustering. APWeb/WAIM 2007: 350-357 - 2006
- [j2]Yi-Zheng Fan, Yi Wang:
Special integral variation of trees. Discuss. Math. Graph Theory 26(1): 49-58 (2006) - 2002
- [j1]Yi-Zheng Fan, Jiong-Sheng Li:
Algebraic Multiplicity of the Eigenvalues of a Bipartite Tournament Matrix. SIAM J. Matrix Anal. Appl. 24(2): 475-483 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
