2009 |
27 | EE | Juan Liu,
Lin Sun,
Jixiang Meng:
A line digraph of a complete bipartite digraph.
Appl. Math. Lett. 22(4): 544-547 (2009) |
26 | EE | Weihua Yang,
Jixiang Meng:
Extraconnectivity of hypercubes.
Appl. Math. Lett. 22(6): 887-891 (2009) |
25 | EE | Jinyang Chen,
Jixiang Meng,
Lihong Huang:
Super edge-connectivity of mixed Cayley graph.
Discrete Mathematics 309(1): 264-270 (2009) |
2008 |
24 | | Juan Liu,
Jixiang Meng:
Super-Arc-Connected and Super-Connected Total Digraphs.
Ars Comb. 87: (2008) |
23 | | Xiaodong Liang,
Jixiang Meng:
Connectivity of bi-Cayley Graphs.
Ars Comb. 88: (2008) |
22 | EE | Zhao Zhang,
Jixiang Meng:
Super-connected edge transitive graphs.
Discrete Applied Mathematics 156(10): 1948-1953 (2008) |
21 | EE | Fengxia Liu,
Jixiang Meng:
Edge-connectivity of regular graphs with two orbits.
Discrete Mathematics 308(16): 3711-3716 (2008) |
20 | EE | Juan Liu,
Jixiang Meng:
Super-connected and super-arc-connected Cartesian product of digraphs.
Inf. Process. Lett. 108(3): 90-93 (2008) |
19 | EE | Rui Li,
Jixiang Meng:
Reversals Cayley graphs of symmetric groups.
Inf. Process. Lett. 109(2): 130-132 (2008) |
2007 |
18 | EE | Xiaodong Liang,
Jixiang Meng:
Connectivity of Connected Bipartite Graphs with Two Orbits.
International Conference on Computational Science (3) 2007: 334-337 |
2006 |
17 | | Zhao Zhang,
Jixiang Meng:
Restricted Edge Connectivity of Edge Transitive Graphs.
Ars Comb. 78: (2006) |
16 | EE | Zhao Zhang,
Jixiang Meng:
On optimally-lambda(3) transitive graphs.
Discrete Applied Mathematics 154(6): 1011-1018 (2006) |
15 | EE | Zhao Zhang,
Jixiang Meng:
Semi-hyper-connected edge transitive graphs.
Discrete Mathematics 306(7): 705-710 (2006) |
2004 |
14 | EE | Baoyindureng Wu,
Jixiang Meng:
Hamiltonian jump graphs.
Discrete Mathematics 289(1-3): 95-106 (2004) |
2003 |
13 | EE | Jixiang Meng:
Connectivity of Vertex and Edge Transitive Graphs.
Discrete Applied Mathematics 127(3): 601-613 (2003) |
12 | EE | Jixiang Meng:
Optimally super-edge-connected transitive graphs.
Discrete Mathematics 260(1-3): 239-248 (2003) |
11 | EE | Jixiang Meng,
Zhao Zhang:
Number of minimum vertex cuts in transitive graphs.
Discrete Mathematics 270(1-3): 310-316 (2003) |
2002 |
10 | | Jixiang Meng,
Youhu Ji:
On a kind of restricted edge connectivity of graphs.
Discrete Applied Mathematics 117(1-3): 183-193 (2002) |
2000 |
9 | EE | Jixiang Meng,
Jianzhong Wang:
A classification of 2-arc-transitive circulant digraphs.
Discrete Mathematics 222(1-3): 281-284 (2000) |
8 | EE | Jixiang Meng,
Bao Ying:
Normal Minimal Cayley Digraphs of Abelian Groups.
Eur. J. Comb. 21(4): 523-528 (2000) |
7 | EE | Qiongxiang Huang,
Jixiang Meng:
A Classification of DCI(CI)-Subsets for Cyclic Group of Odd Prime Power Order.
J. Comb. Theory, Ser. B 78(1): 24-34 (2000) |
1998 |
6 | EE | Jixiang Meng,
Qiongxiang Huang:
Almost all Cayley graphs have diameter 2.
Discrete Mathematics 178(1-3): 267-269 (1998) |
5 | EE | Jixiang Meng,
Mingyao Xu:
On the isomorphism problem of Cayley graphs of Abelian groups.
Discrete Mathematics 187(1-3): 161-169 (1998) |
1997 |
4 | EE | Jixiang Meng,
Qiongxiang Huang:
The Automorphism Groups of Minimal Infinite Circulant Digraphs.
Eur. J. Comb. 18(4): 425-429 (1997) |
1996 |
3 | | Jixiang Meng:
Superconnectivity for Minimal Multi-loop Networks.
COCOON 1996: 417-419 |
1995 |
2 | | Jixiang Meng:
Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups.
COCOON 1995: 384-387 |
1 | EE | Jixiang Meng:
The generalized S-graphs of diameter 3.
Discrete Mathematics 140(1-3): 95-106 (1995) |