Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiang-Feng Pan
Person information
- affiliation: Anhui University, School of Mathematical Sciences, Hefei, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Wasim Sajjad
, Muhammad Shoaib Sardar, Xiang-Feng Pan:
Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron. Appl. Math. Comput. 461: 128313 (2024)- [j28]Muhammad Shoaib Sardar, Xiang-Feng Pan, Shou-Jun Xu:
Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs. Appl. Math. Comput. 473: 128670 (2024) - 2023
- [j27]Jian Lu, Xiang-Feng Pan:
Injective edge coloring of some sparse graphs. J. Appl. Math. Comput. 69(4): 3421-3431 (2023) - 2022
- [j26]Si-Ao Xu, Yun-Xiang Li, Hongbo Hua, Xiang-Feng Pan:
On the resistance diameters of graphs and their line graphs. Discret. Appl. Math. 306: 174-185 (2022) - [j25]Yun-Xiang Li, Si-Ao Xu, Hongbo Hua, Xiang-Feng Pan:
On the resistance diameter of the Cartesian and lexicographic product of paths. J. Appl. Math. Comput. 68(3): 1743-1755 (2022) - 2021
- [j24]Jian Lu, Xiang-Feng Pan, Huiqing Liu:
Bicyclic graphs with extremal cover cost. Appl. Math. Comput. 405: 126235 (2021) - [j23]Muhammad Shoaib Sardar, Xiang-Feng Pan, Si-Ao Xu:
Some Two-Vertex Resistances of Nested Triangle Network. Circuits Syst. Signal Process. 40(3): 1511-1524 (2021) - [j22]Li-Dan Pei, Xiangfeng Pan, Kun Wang, Jing Tian:
Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity. Discret. Appl. Math. 289: 292-301 (2021) - 2020
- [j21]Muhammad Shoaib Sardar, Xiang-Feng Pan, Si-Ao Xu:
Computation of resistance distance and Kirchhoff index of the two classes of silicate networks. Appl. Math. Comput. 381: 125283 (2020) - [j20]Li-Dan Pei, Xiang-Feng Pan:
The minimum eccentric distance sum of trees with given distance k-domination number. Discret. Math. Algorithms Appl. 12(4): 2050052:1-2050052:16 (2020)
2010 – 2019
- 2019
- [j19]Kun Wang, Xiangfeng Pan, Wenjie Ning:
On the signless Laplacian Estrada index of cacti. Discret. Appl. Math. 254: 189-195 (2019) - [j18]Hassan Raza, Sakander Hayat, Xiang-Feng Pan:
On the fault-tolerant metric dimension of certain interconnection networks. J. Appl. Math. Comput. 60(1-2): 517-535 (2019) - 2018
- [j17]Hassan Raza, Sakander Hayat, Xiang-Feng Pan:
On the fault-tolerant metric dimension of convex polytopes. Appl. Math. Comput. 339: 172-185 (2018) - [j16]Jia-Bao Liu, Xiang-Feng Pan, Shicai Gong:
The characteristic polynomial of a graph operation and its applications. Ars Comb. 137: 249-255 (2018) - [j15]Li-Dan Pei, Xiang-Feng Pan, Fu-Tao Hu:
Some improved inequalities related to Vizing's conjecture. Inf. Process. Lett. 135: 85-91 (2018) - [j14]Hassan Raza, Sakander Hayat, Xiang-Feng Pan:
Binary Locating-Dominating Sets in Rotationally-Symmetric Convex Polytopes. Symmetry 10(12): 727 (2018) - 2016
- [j13]Jia-Bao Liu, Xiang-Feng Pan:
Minimizing Kirchhoff index among graphs with a given vertex bipartiteness. Appl. Math. Comput. 291: 84-88 (2016) - [j12]Jia-Bao Liu, Xiang-Feng Pan, Fu-Tao Hu:
The Laplacian polynomial of graphs derived from regular graphs and applications. Ars Comb. 126: 289-300 (2016) - [j11]Jia-Bao Liu, Xiang-Feng Pan, Lei Yu, Dong Li:
Complete characterization of bicyclic graphs with minimal Kirchhoff index. Discret. Appl. Math. 200: 95-107 (2016) - [j10]Jia-Bao Liu, Wen-Rui Wang, Yong-Ming Zhang, Xiang-Feng Pan:
On degree resistance distance of cacti. Discret. Appl. Math. 203: 217-225 (2016) - 2015
- [j9]Jia-Bao Liu, Xiang-Feng Pan, Fu-Tao Hu, Feng-Feng Hu:
Asymptotic Laplacian-energy-like invariant of lattices. Appl. Math. Comput. 253: 205-214 (2015) - [j8]Jia-Bao Liu, Xiang-Feng Pan:
A unified approach to the asymptotic topological indices of various lattices. Appl. Math. Comput. 270: 62-73 (2015) - 2014
- [j7]Xiaolan Hu, Huiqing Liu, Xiang-Feng Pan:
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults. Discret. Appl. Math. 169: 152-161 (2014) - 2011
- [j6]Xiang-Feng Pan, Huiqing Liu, Meimei Liu:
Sharp bounds on the zeroth-order general Randić index of unicyclic graphs with given diameter. Appl. Math. Lett. 24(5): 687-691 (2011) - [j5]Xiang-Feng Pan, Xiaolan Hu, Xiuguo Liu, Huiqing Liu:
The spectral moments of trees with given maximum degree. Appl. Math. Lett. 24(7): 1265-1268 (2011) - [j4]Xiangfeng Pan, Meijie Ma, Jun-Ming Xu:
Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs. Ars Comb. 98: 461-470 (2011) - [j3]Xiang-Feng Pan, Ning-Ning Lv:
Sharp bounds of the zeroth-order general Randic index of bicyclic graphs with given pendent vertices. Discret. Appl. Math. 159(4): 240-245 (2011)
2000 – 2009
- 2007
- [j2]Meijie Ma, Guizhen Liu, Xiangfeng Pan:
Path embedding in faulty hypercubes. Appl. Math. Comput. 192(1): 233-238 (2007) - 2003
- [j1]Xiang-Feng Pan, Jingzhong Mao, Huiqing Liu:
Minimally (k, k-1)-edge-connected graphs. Australas. J Comb. 28: 39-50 (2003)
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-07-05 20:19 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:
