default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQianqian Chen 0005
Person information
- affiliation: Yancheng Teachers University, School of Mathematics and Statistics, China
- affiliation: East China University of Science and Technology (ECUST), School of Mathematics, Shanghai, China
Other persons with the same name
- Qianqian Chen (aka: QianQian Chen, Qian-Qian Chen) — disambiguation page
- Qianqian Chen 0001
![[0009-0005-4530-5451]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0009-0005-4530-5451")
— Shanghai Jiao Tong University, School of Automation and Intelligent Sensing, Shanghai, China (and 1 more) - Qianqian Chen 0002 — ShanghaiTech University, School of Biomedical Engineering, China (and 2 more)
- Qianqian Chen 0003 — Beijing University of Technology, Beijing Modern Manufacturing Development, School of Economics and Management, China
- Qianqian Chen 0004 (aka: Qian-Qian Chen 0004) — Qingdao University, College of Electronic Information, China (and 2 more)
- Qianqian Chen 0006 — Zhejiang University, Department of Mathematics, Hangzhou, China
- Qianqian Chen 0007 — Anhui University, School of Computer Science and Technology, Hefei, China
- Qianqian Chen 0008 — Beijing University of Posts and Telecommunications, School of Information and Communication Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j4]Qian-Qian Chen, Ji-Ming Guo:
The multiplicity of nonzero eigenvalues and the induced matching number of a graph. Discret. Math. 349(2): 114762 (2026)- 2025
- [j3]Zhiwen Wang, Qian-Qian Chen, Ji-Ming Guo, Xiao-Meng Li:
A relation between multiplicity of 1 as a Laplacian eigenvalue and induced matching numbers in trees. Discret. Math. 348(5): 114401 (2025) - 2023
- [j2]Qian-Qian Chen, Ji-Ming Guo:
Nordhaus-Gaddum type inequality for the integer k-matching number of a graph. Discret. Appl. Math. 340: 21-31 (2023) - 2022
- [j1]Qian-Qian Chen, Ji-Ming Guo:
The nullity of a graph with fractional matching number. Discret. Math. 345(8): 112919 (2022)
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 2026-05-20 23:29 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:
