![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Xian'an Jin
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Qi Yan, Xian'an Jin:
Partial-twuality polynomials of delta-matroids. Adv. Appl. Math. 153: 102623 (2024) - [j29]Tianlong Ma, Xian'an Jin, Weiling Yang:
Convolution formulas for multivariate arithmetic Tutte polynomials. Adv. Appl. Math. 157: 102692 (2024) - [j28]Jingyuan Zhang, Fuliang Lu, Xian'an Jin:
Counting spanning trees of (1, N)-periodic graphs. Discret. Appl. Math. 344: 88-101 (2024) - [j27]Xiaxia Guan, Xian'an Jin, Tianlong Ma:
The interior and exterior polynomials are well-defined. Discret. Appl. Math. 345: 246-253 (2024) - [j26]Jingyuan Zhang, Xian'an Jin, Weigen Yan, Qinghai Liu:
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph. Discret. Math. 347(9): 114063 (2024) - [j25]Xiaxia Guan, Weiling Yang, Xian'an Jin:
On the polymatroid Tutte polynomial. J. Comb. Theory A 201: 105798 (2024) - 2023
- [j24]Ruiling Zheng
, Peifeng Su
, Xian'an Jin:
Arithmetic-geometric matrix of graphs and its applications. Appl. Math. Comput. 442: 127764 (2023) - [j23]Ruiling Zheng, Xiaxia Guan, Xian'an Jin:
Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property $$P^{*}$$. J. Appl. Math. Comput. 69(3): 2573-2594 (2023) - 2022
- [j22]Qi Yan, Xian'an Jin:
Twist polynomials of delta-matroids. Adv. Appl. Math. 139: 102363 (2022) - [j21]Qi Yan, Xian'an Jin:
A-trails of embedded graphs and twisted duals. Ars Math. Contemp. 22(2): 2 (2022) - [j20]Xia Guo, Xian'an Jin, Qi Yan:
Excluded checkerboard colourable ribbon graph minors. Discret. Math. 345(10): 112992 (2022) - [j19]Qi Yan, Xian'an Jin:
Counterexamples to the interpolating conjecture on partial-dual genus polynomials of ribbon graphs. Eur. J. Comb. 102: 103493 (2022) - [j18]Xiaotong Li, Xian'an Jin, Qi Yan:
The Ihara-Zeta Function and the Spectrum of the Join of Two Semi-Regular Bipartite Graphs. Graphs Comb. 38(3): 82 (2022) - 2021
- [j17]Tianlong Ma, Xian'an Jin, Fuji Zhang:
Tutte polynomials of fan-like graphs with applications in benzenoid systems. Appl. Math. Comput. 411: 126496 (2021) - [j16]Qi Yan, Xian'an Jin:
Counterexamples to a conjecture by Gross, Mansour and Tucker on partial-dual genus polynomials of ribbon graphs. Eur. J. Comb. 93: 103285 (2021) - [j15]Xia Guo, Xian'an Jin, Qi Yan:
Characterization of regular checkerboard colourable twisted duals of ribbon graphs. J. Comb. Theory A 180: 105428 (2021) - 2020
- [j14]Qingying Deng, Xian'an Jin, Metrose Metsidik:
Characterizations of bipartite and Eulerian partial duals of ribbon graphs. Discret. Math. 343(1): 111637 (2020) - [j13]Metrose Metsidik
, Xian'an Jin:
Eulerian and even-face ribbon graph minors. Discret. Math. 343(9): 111953 (2020) - [j12]Helin Gong, Xian'an Jin, Mengchen Li:
Several Extreme Coefficients of the Tutte Polynomial of Graphs. Graphs Comb. 36(3): 445-457 (2020)
2010 – 2019
- 2019
- [j11]Qi Yan, Xian'an Jin:
Extremal embedded graphs. Ars Math. Contemp. 17(2): 637-652 (2019) - 2018
- [j10]Qingying Deng, Xian'an Jin, Fengming Dong
, Eng Guan Tay:
Even Subgraph Expansions for the Flow Polynomial of Planar Graphs with Maximum Degree at Most 4. Electron. J. Comb. 25(2): 2 (2018) - [j9]Xiaoling Ma, Baoyindureng Wu, Xian'an Jin:
Edge-disjoint spanning trees and the number of maximum state circles of a graph. J. Comb. Optim. 35(4): 997-1008 (2018) - [j8]Metrose Metsidik
, Xian'an Jin:
Eulerian partial duals of plane graphs. J. Graph Theory 87(4): 509-515 (2018) - [j7]Helin Gong
, Xian'an Jin:
A simple formula for the number of spanning trees of line graphs. J. Graph Theory 88(2): 294-301 (2018) - 2015
- [j6]Fengming Dong
, Xian'an Jin:
Zeros of Jones Polynomials of Graphs. Electron. J. Comb. 22(3): 3 (2015) - 2012
- [j5]Yuefeng Lin, Steven D. Noble
, Xian'an Jin, Wenfang Cheng:
On plane graphs with link component number equal to the nullity. Discret. Appl. Math. 160(9): 1369-1375 (2012) - 2010
- [j4]Xian'an Jin, Fuji Zhang, Fengming Dong
, Eng Guan Tay:
Zeros of the Jones Polynomial are Dense in the Complex Plane. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j3]Xian'an Jin, Fengming Dong
, Eng Guan Tay:
On graphs determining links with maximal number of components via medial construction. Discret. Appl. Math. 157(14): 3099-3110 (2009) - 2007
- [j2]Xian'an Jin, Fuji Zhang:
The replacements of signed graphs and Kauffman brackets of link families. Adv. Appl. Math. 39(2): 155-172 (2007) - 2005
- [j1]Xian'an Jin, Fuji Zhang:
The Kauffman brackets for equivalence classes of links. Adv. Appl. Math. 34(1): 47-64 (2005)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-18 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint