default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMin Feng 0004
Person information
- affiliation: Nanjing University of Science and Technology, School of Science, China
- affiliation (former): Beijing Normal University, Sch. Math. Sci. & Lab. Math. Com. Sys., China
Other persons with the same name
- Min Feng — disambiguation page
- Min Feng 0001 — NEC Labs. America, Cupertino, CA, USA (and 1 more)
- Min Feng 0002 — Microsoft Research Asia, Beijing, China
- Min Feng 0003
![[0000-0002-9705-0156]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9705-0156")
— Beijing University of Posts and Telecommunications, State Key Laboratory of Networking and Switching Technology, China (and 1 more) - Min Feng 0005 — Chongqing University, College of Mathematics and Statistics, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Min Feng, Xuanlong Ma, Lihua Feng:
Optimal identifying codes of two families of Cayley graphs. Discret. Appl. Math. 320: 199-210 (2022)- [j13]Min Feng, Xuanlong Ma, Huiling Xu:
Completeness-Resolvable Graphs. Graphs Comb. 38(2): 32 (2022) - 2020
- [j12]Xuanlong Ma, Min Feng, Kaishun Wang:
Subgroup perfect codes in Cayley sum graphs. Des. Codes Cryptogr. 88(7): 1447-1461 (2020)
2010 – 2019
- 2019
- [j11]Huiling Xu, Xuefeng Chen, Min Feng:
Performance analysis and distributed filter design for networked dynamic systems over finite-frequency ranges. Neurocomputing 334: 143-155 (2019) - [j10]Xuefeng Chen, Huiling Xu, Min Feng:
H2 performance analysis and H2 distributed control design for systems interconnected over an arbitrary graph. Syst. Control. Lett. 124: 1-11 (2019) - 2018
- [j9]Xuanlong Ma, Min Feng, Kaishun Wang:
The strong metric dimension of the power graph of a finite group. Discret. Appl. Math. 239: 159-164 (2018) - 2017
- [j8]Xuanlong Ma, Min Feng, Kaishun Wang:
The Power Index of a Graph. Graphs Comb. 33(5): 1381-1391 (2017) - 2016
- [j7]Min Feng, Xuanlong Ma, Kaishun Wang:
The full automorphism group of the power (di)graph of a finite group. Eur. J. Comb. 52: 197-206 (2016) - [j6]Xuanlong Ma, Min Feng, Kaishun Wang:
The Rainbow Connection Number of the Power Graph of a Finite Group. Graphs Comb. 32(4): 1495-1504 (2016) - 2015
- [j5]Min Feng, Xuanlong Ma, Kaishun Wang:
The structure and metric dimension of the power graph of a finite group. Eur. J. Comb. 43: 82-97 (2015) - 2014
- [j4]Min Feng, Kaishun Wang:
Identifying codes of corona product graphs. Discret. Appl. Math. 169: 88-96 (2014) - [j3]Min Feng, Benjian Lv, Kaishun Wang:
On the fractional metric dimension of graphs. Discret. Appl. Math. 170: 55-63 (2014) - 2013
- [j2]Min Feng, Min Xu, Kaishun Wang:
On the metric dimension of line graphs. Discret. Appl. Math. 161(6): 802-805 (2013) - 2012
- [j1]Min Feng, Kaishun Wang:
On the metric dimension of bilinear forms graphs. Discret. Math. 312(6): 1266-1268 (2012)
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-10-13 18:01 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:
