Zhan, Xingzhi ( 詹兴致 )
| Title： | Professor |
|---|---|
| Department： | Applied Mathematics |
| Office： | Room 323, Math Building |
| Telephone： | 54342646-323 |
| Email： | zhan@math.ecnu.edu.cn |
| Homepage： | http://math.ecnu.edu.cn/~zhan |
| Homepage2： | https://faculty.ecnu.edu.cn/_s42/zxz2/main.psp |
Research Interest
Graph Theory and Matrix Theory
Resume
Selected Publications
Recent Publications(From MathSciNet)
MR5054390
Pending
Li, Chengli; Zhan, Xingzhi Every 2-connected $[4,2]$-graph of order at least seven contains a pancyclic edge.
Discrete Math. 349 (2026), no. 8, Paper No. 115154, 12 pp. 05C38 (05C45 05C75)
Publication Year 2026
Indexed 2026-05-28
MR4926339
Reviewed
Cheng, Kun; Tang, Yurui; Zhan, Xingzhi Sparse graphs with an independent or foresty minimum vertex cut.
Discrete Math. 349 (2026), no. 1, Paper No. 114658, 6 pp. (Reviewer: Alpay Kirlangic) 05C40 (05C69)
Publication Year 2026
Indexed 2025-08-22
Review Published2026-02-26
MR4955363
Reviewed
Zhan, Xingzhi A sufficient condition for pancyclic graphs.
Bull. Aust. Math. Soc. 112 (2025), no. 2, 220–226. (Reviewer: Zbigniew R. Bogdanowicz) 05C38 (05C42 05C45 05C75)
Publication Year 2025
Indexed 2025-10-27
Review Published2026-04-06
MR4905900
Reviewed
Li, Chengli; Liu, Feng; Zhan, Xingzhi The minimum size and maximum diameter of an edge-pancyclic graph of a given order.
Discrete Math. 348 (2025), no. 11, Paper No. 114576, 8 pp. (Reviewer: Fengwei Li) 05C35 (05C12 05C38)
Publication Year 2025
Indexed 2025-07-11
Review Published2026-01-05
MR4870033
Reviewed
Hu, Yanan; Zhan, Xingzhi On the metric subgraphs of a graph.
Ars Math. Contemp. 25 (2025), no. 1, Paper No. 3, 13 pp. 05C12 (05C35 05C38)
Publication Year 2025
Indexed 2025-04-04
Review Published2025-12-12
MR4858047
Reviewed
Yan, Jingru; Zhan, Xingzhi The Turán number of book graphs.
Indian J. Pure Appl. Math. 56 (2025), no. 1, 140–149. 05C35 (05C75)
Publication Year 2025
Indexed 2025-04-02
Review Published2025-04-08
MR4794738
Reviewed
Zhan, Xingzhi The minimum number of detours in graphs.
Australas. J. Combin. 90 (2024), 85–93. (Reviewer: Zhiyong Gan) 05C38 (05C70)
Publication Year 2024
Indexed 2024-10-16
Review Published2025-01-30
MR4787930
Reviewed
Zhan, Xingzhi A conjecture generalizing Thomassen's chord conjecture in graph theory.
Bull. Iranian Math. Soc. 50 (2024), no. 5, Paper No. 69, 4 pp. (Reviewer: Mark N. Ellingham) 05C38 (05C35 05C40)
Publication Year 2024
Indexed 2024-10-22
Review Published2025-09-05
MR4762973
Reviewed
Hu, Yanan; Zhan, Xingzhi; Zhang, Leilei Graphs with many independent vertex cuts.
Graphs Combin. 40 (2024), no. 4, Paper No. 83, 5 pp. 05C40 (05C69)
Publication Year 2024
Indexed 2024-09-06
Review Published2025-05-15
MR4623763
Reviewed
Qiao, Pu; Zhan, Xingzhi Two-degree trees.
J. East China Norm. Univ. Natur. Sci. Ed. 2023, no. 2, 1–4. 05C12 (05C05 05C25 05C40 05C45)
Publication Year 2023
Indexed 2023-09-27
Review Published2023-10-06
MR4492115
Reviewed
Zhan, Xingzhi; Zhang, Leilei The maximum size of a nonhamiltonian graph with given order and connectivity.
Discrete Math. 346 (2023), no. 1, Paper No. 113208, 8 pp. 05C40 (05C45)
Publication Year 2023
Indexed 2022-12-07
Review Published2023-08-29
MR4583371
Reviewed
Hu, Yanan; Zhan, Xingzhi On almost self-centered graphs and almost peripheral graphs.
Taiwanese J. Math. 26 (2022), no. 5, 887–901. (Reviewer: Cristina Jordán) 05C35 (05C07 05C69)
Publication Year 2022
Indexed 2023-06-01
Review Published2023-12-03
MR4477866
Reviewed
Zhan, Xingzhi The maximum degree of a minimally hamiltonian-connected graph.
Discrete Math. 345 (2022), no. 12, Paper No. 113159, 5 pp. 05C45 (05C40)
Publication Year 2022
Indexed 2022-10-31
Review Published2022-12-07
MR4412764
Reviewed
Qiao, Pu; Zhan, Xingzhi The relation between the number of leaves of a tree and its diameter.
Czechoslovak Math. J. 72(147) (2022), no. 2, 365–369. (Reviewer: Aparna Savithri Lakshmanan) 05C05 (05C12 05C35)
Publication Year 2022
Indexed 2022-06-07
Review Published2022-12-12
MR4404506
Reviewed
Vrána, Petr; Zhan, Xingzhi; Zhang, Leilei Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected.
Discrete Math. 345 (2022), no. 8, Paper No. 112909, 4 pp. 05C69 (05C40 05C45)
Publication Year 2022
Indexed 2022-05-12
Review Published2022-05-17
MR4392362
Reviewed
Qiao, Pu; Zhan, Xingzhi On a problem of Erdős about graphs whose size is the Turán number plus one.
Bull. Aust. Math. Soc. 105 (2022), no. 2, 177–187. (Reviewer: Zhenhua Lyu) 05C35 (05C30 05C75)
Publication Year 2022
Indexed 2022-04-19
Review Published2022-08-26
MR4359389
Reviewed
Hu, Yanan; Zhan, Xingzhi Regular homogeneously traceable nonhamiltonian graphs.
Discrete Appl. Math. 310 (2022), 60–64. 05C45 (05C38)
Publication Year 2022
Indexed 2022-02-09
Review Published2022-02-18
MR4321726
Reviewed
Hu, Yanan; Zhan, Xingzhi Possible cardinalities of the center of a graph.
Bull. Malays. Math. Sci. Soc. 44 (2021), no. 6, 3629–3636. 05C12 (05C30)
Publication Year 2021
Indexed 2021-11-15
Review Published2022-01-07
MR4308134
Reviewed
Qiao, Pu; Zhan, Xingzhi The diameter and radius of radially maximal graphs.
Bull. Aust. Math. Soc. 104 (2021), no. 2, 196–202. (Reviewer: Ignacio M. Pelayo) 05C12 (05C35)
Publication Year 2021
Indexed 2021-10-20
Review Published2022-06-16
MR4043755
Reviewed
Qiao, Pu; Zhan, Xingzhi The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order.
J. Graph Theory 93 (2020), no. 2, 222–229. (Reviewer: Zdeněk Ryjáček) 05C45 (05C75)
Publication Year 2020
Indexed 2020-02-13
Review Published2020-05-08
Copyright 2018 All rights reserved School of Mathematical Sciences, East China Normal University