学术论文 |
[1] Z. Luo, K. Xu. Computing the number and average size of connected sets in planar 3-trees. Graphs and Combinatorics, 2024, 40: 55. [2] Z. Luo, K. Xu. The number of connected sets in Apollonian networks. Applied Mathematics and Computation, 2024, 479: 128883. [3] Z. Luo, K. Xu, J. Tian. Random subtrees and unimodal sequences in graphs. Discrete Mathematics, 2024, 347: 113654. [4] Z. Luo, K. Xu, S. Wagner, H. Wang. On the mean subtree order of trees under edge contraction. Journal of Graph Theory, 2023, 102: 535-551. [5] Z. Luo, K. Xu. On the local and global mean orders of sub-k-trees of k-trees. The Electronic Journal of Combinatorics, 2023, 30: P1.43. [6] Z. Luo, K. Xu. Extremal problems for connected set enumeration. Discrete Applied Mathematics, 2023, 340: 41-52. [7] K. Xu, J. Li, Z. Luo. Comparative results between the number of subtrees and Wiener index of graphs. RAIRO Operations Research, 2022, 56: 2495-2511. [8] Z. Luo, L. Xu. A kind of conditional vertex connectivity of Cayley graphs generated by wheel graphs. The Computer Journal, 2020, 63: 1372-1384. [9] L. Xu, S. Zhou, G. Lian, Z. Luo. A kind of conditional connectivity of Cayley graphs generated by 2-trees. The Computer Journal, 2018, 61: 714-721. |
