The SCEAS System
| |||||||

## Search the dblp DataBase
Jixiang Meng:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jixiang Meng
**Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups.**[Citation Graph (0, 0)][DBLP] COCOON, 1995, pp:384-387 [Conf] - Jixiang Meng
**Superconnectivity for Minimal Multi-loop Networks.**[Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:417-419 [Conf] - Zhao Zhang, Jixiang Meng
**Restricted Edge Connectivity of Edge Transitive Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2006, v:78, n:, pp:- [Journal] - Jixiang Meng
**Connectivity of Vertex and Edge Transitive Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:127, n:3, pp:601-613 [Journal] - Jixiang Meng, Youhu Ji
**On a kind of restricted edge connectivity of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:183-193 [Journal] - Zhao Zhang, Jixiang Meng
**On optimally-**[Citation Graph (0, 0)][DBLP]*lambda*^{(3)}transitive graphs. Discrete Applied Mathematics, 2006, v:154, n:6, pp:1011-1018 [Journal] - Jixiang Meng
**Optimally super-edge-connected transitive graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:260, n:1-3, pp:239-248 [Journal] - Jixiang Meng, Jianzhong Wang
**A classification of 2-arc-transitive circulant digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:222, n:1-3, pp:281-284 [Journal] - Jixiang Meng, Zhao Zhang
**Number of minimum vertex cuts in transitive graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:270, n:1-3, pp:310-316 [Journal] - Baoyindureng Wu, Jixiang Meng
**Hamiltonian jump graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:289, n:1-3, pp:95-106 [Journal] - Zhao Zhang, Jixiang Meng
**Semi-hyper-connected edge transitive graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:7, pp:705-710 [Journal] - Jixiang Meng, Qiongxiang Huang
**The Automorphism Groups of Minimal Infinite Circulant Digraphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:4, pp:425-429 [Journal] - Jixiang Meng, Bao Ying
**Normal Minimal Cayley Digraphs of Abelian Groups.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2000, v:21, n:4, pp:523-528 [Journal] - Qiongxiang Huang, Jixiang Meng
**A Classification of**[Citation Graph (0, 0)][DBLP]*DCI(CI)*-Subsets for Cyclic Group of Odd Prime Power Order. J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:24-34 [Journal] - Xiaodong Liang, Jixiang Meng
**Connectivity of Connected Bipartite Graphs with Two Orbits.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2007, pp:334-337 [Conf] - Jixiang Meng, Mingyao Xu
**On the isomorphism problem of Cayley graphs of Abelian groups.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:187, n:1-3, pp:161-169 [Journal] - Jixiang Meng, Qiongxiang Huang
**Almost all Cayley graphs have diameter 2.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:178, n:1-3, pp:267-269 [Journal] - Jixiang Meng
**The generalized S-graphs of diameter 3.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:140, n:1-3, pp:95-106 [Journal] **A line digraph of a complete bipartite digraph.**[Citation Graph (, )][DBLP]**Extraconnectivity of hypercubes.**[Citation Graph (, )][DBLP]**Embedding connected double-loop networks with even cardinality in books.**[Citation Graph (, )][DBLP]**Coloring and the Lovász Local Lemma.**[Citation Graph (, )][DBLP]**Connectivity of bi-Cayley Graphs.**[Citation Graph (, )][DBLP]**Super-Arc-Connected and Super-Connected Total Digraphs.**[Citation Graph (, )][DBLP]**Super-connected edge transitive graphs.**[Citation Graph (, )][DBLP]**Super-connected arc-transitive digraphs.**[Citation Graph (, )][DBLP]**Double-super-connected digraphs.**[Citation Graph (, )][DBLP]**Edge-connectivity of regular graphs with two orbits.**[Citation Graph (, )][DBLP]**Super edge-connectivity of mixed Cayley graph.**[Citation Graph (, )][DBLP]**On super restricted edge-connectivity of edge-transitive graphs.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |