Остановите войну!
for scientists:
default search action
Xingzhi Zhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Xingzhi Zhan, Leilei Zhang:
The maximum size of a nonhamiltonian graph with given order and connectivity. Discret. Math. 346(1): 113208 (2023) - 2022
- [j18]Yanan Hu, Xingzhi Zhan:
Regular homogeneously traceable nonhamiltonian graphs. Discret. Appl. Math. 310: 60-64 (2022) - [j17]Petr Vrána, Xingzhi Zhan, Leilei Zhang:
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. Discret. Math. 345(8): 112909 (2022) - [j16]Xingzhi Zhan:
The maximum degree of a minimally hamiltonian-connected graph. Discret. Math. 345(12): 113159 (2022) - 2020
- [j15]Pu Qiao, Xingzhi Zhan:
Pairs of a tree and a nontree graph with the same status sequence. Discret. Math. 343(2): 111662 (2020) - [j14]Pu Qiao, Xingzhi Zhan:
The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order. J. Graph Theory 93(2): 222-229 (2020)
2010 – 2019
- 2019
- [j13]Pu Qiao, Xingzhi Zhan:
The Largest Graphs with Given Order and Diameter: A Simple Proof. Graphs Comb. 35(6): 1715-1716 (2019) - 2018
- [j12]Pu Qiao, Xingzhi Zhan:
The maximum girth and minimum circumference of graphs with prescribed radius and diameter. Discret. Math. 341(10): 2827-2830 (2018) - [j11]Pu Qiao, Xingzhi Zhan:
On Vertex Types of Graphs. Graphs Comb. 34(5): 889-900 (2018) - 2012
- [j10]Zejun Huang, Xingzhi Zhan:
Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths. Discret. Math. 312(15): 2203-2213 (2012) - 2011
- [j9]Zejun Huang, Xingzhi Zhan:
Digraphs that have at most one walk of a given length with the same endpoints. Discret. Math. 311(1): 70-79 (2011)
2000 – 2009
- 2005
- [j8]Xingzhi Zhan:
Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval. SIAM J. Matrix Anal. Appl. 27(3): 851-860 (2005) - 2003
- [j7]Xingzhi Zhan:
The Sharp Rado Theorem for Majorizations. Am. Math. Mon. 110(2): 152-153 (2003) - 2001
- [j6]Xingzhi Zhan:
Singular Values of Differences of Positive Semidefinite Matrices. SIAM J. Matrix Anal. Appl. 22(3): 819-823 (2001) - [j5]Fan Ding, Xingzhi Zhan:
On the Unitary Orbit of Complex Matrices. SIAM J. Matrix Anal. Appl. 23(2): 511-516 (2001) - [j4]Xingzhi Zhan:
Linear Preservers That Permute the Entries of a Matrix. Am. Math. Mon. 108(7): 643-645 (2001)
1990 – 1999
- 1998
- [j3]Xingzhi Zhan:
Inequalities for Unitarily Invariant Norms. SIAM J. Matrix Anal. Appl. 20(2): 466-470 (1998) - 1997
- [j2]Xingzhi Zhan:
Inequalities for the Singular Values of Hadamard Products. SIAM J. Matrix Anal. Appl. 18(4): 1093-1095 (1997) - 1996
- [j1]Xingzhi Zhan:
Computing the Extremal Positive Definite Solutions of a Matrix Equation. SIAM J. Sci. Comput. 17(5): 1167-1174 (1996)
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 2023-09-27 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint