Jixiang Meng

According to our database, Jixiang Meng authored at least 181 papers between 1995 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Fault tolerance assessment for hamming graphs based on r-restricted R-structure(substructure) fault pattern.

Yayu Yang, Mingzu Zhang, Jixiang Meng

Appl. Math. Comput., 2025

Disjoint path covers of star graphs.

Hongwei Qiao, Jixiang Meng

Appl. Math. Comput., 2025

Minimizing the least Laplacian eigenvalue of signed complete graphs.

Dan Li, Minghui Yan, Jixiang Meng

Appl. Math. Comput., 2025

2024

The Strong Menger Connectivity of the Directed k-Ary n-Cube.

Guoqiang Xie, Jixiang Meng

J. Interconnect. Networks, June, 2024

Using Euler's Formula to Find the Lower Bound of the Page Number.

Bin Zhao, Peng Li, Jixiang Meng, Yuepeng Zhang

Graphs Comb., May, 2024

Unbalanced signed bicyclic graphs minimizing the least eigenvalue.

Zhaolin Teng, Dan Li, Yuanyuan Chen, Jixiang Meng

Appl. Math. Comput., April, 2024

Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks.

Eminjan Sabir, Jianxi Fan, Jixiang Meng, Baolei Cheng

IEEE Trans. Reliab., March, 2024

Link fault tolerance of BC networks and folded hypercubes on <i>h</i>-extra <i>r</i>-component edge-connectivity.

Yayu Yang, Mingzu Zhang, Jixiang Meng

Appl. Math. Comput., February, 2024

Antidirected spanning closed trail in tournaments.

Hong Yang, Juan Liu, Jixiang Meng

Appl. Math. Comput., February, 2024

Dominated pair degree sum conditions of supereulerian digraphs.

Changchang Dong, Jixiang Meng, Juan Liu

Discuss. Math. Graph Theory, 2024

Reliability analyses of regular graphs based on edge-structure connectivity.

Na Wang, Jixiang Meng, Yingzhi Tian

Discret. Appl. Math., 2024

The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree.

Hongwei Qiao, Jixiang Meng, Eminjan Sabir

Discret. Appl. Math., 2024

Some graphs determined by their Aα-spectra.

Yuanyuan Chen, Dan Li, Huiqiu Lin, Jixiang Meng

Discret. Appl. Math., 2024

On spanning laceability of bipartite graphs.

Eminjan Sabir, Jixiang Meng, Hongwei Qiao

Appl. Math. Comput., 2024

2023

Ore conditions for antistrong digraphs.

Lili Yuan, Jixiang Meng

Appl. Math. Comput., November, 2023

On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences.

Xuemei Liu, Jixiang Meng, Yingzhi Tian

J. Supercomput., September, 2023

The <i>a</i>-average Degree Edge-Connectivity of Bijective Connection Networks.

Yayu Yang, Mingzu Zhang, Jixiang Meng, Rongda Chen

Comput. J., September, 2023

Antidirected Hamiltonian Paths and Cycles of Digraphs with α ₂-Stable Number 2.

Hong Yang, Juan Liu, Jixiang Meng

Graphs Comb., August, 2023

Degree sequence conditions for a graph to be disjoint path coverable.

Eminjan Sabir, Jixiang Meng

Discret. Appl. Math., June, 2023

Reliabilities for two kinds of graphs with smaller diameters.

Yihong Wang, Jixiang Meng, Jianxi Fan

Appl. Math. Comput., June, 2023

Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes.

Hongwei Qiao, Jixiang Meng

Theor. Comput. Sci., May, 2023

The generalized measure of edge fault tolerance in exchanged 3-ary <i>n</i>-cube.

Yayu Yang, Mingzu Zhang, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., May, 2023

Component connectivity of the data center network DCell.

Xuemei Liu, Jixiang Meng, Eminjan Sabir

Appl. Math. Comput., May, 2023

The edge fault-tolerant spanning laceability of the enhanced hypercube networks.

Hongwei Qiao, Jixiang Meng, Eminjan Sabir

J. Supercomput., April, 2023

Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian.

Lili Yuan, Jixiang Meng

Graphs Comb., April, 2023

Fault tolerance analysis for hamming graphs with large-scale faulty links based on <i>k</i>-component edge-connectivity.

Yayu Yang, Mingzu Zhang, Jixiang Meng

J. Parallel Distributed Comput., March, 2023

The spanning cyclability of Cayley graphs generated by transposition trees.

Hongwei Qiao, Eminjan Sabir, Jixiang Meng

Discret. Appl. Math., March, 2023

Structure fault-tolerance of divide-and-swap <i>k</i>-ary <i>n</i>-cube.

Yu Wang, Jixiang Meng

Theor. Comput. Sci., February, 2023

Extremal Graphs for Sombor Index with Given Parameters.

Wanping Zhang, Jixiang Meng, Na Wang

Axioms, February, 2023

On the sizes of (k, l)-edge-maximal r-uniform hypergraphs.

Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu

Discuss. Math. Graph Theory, 2023

Extremal spectral results related to spanning trees of signed complete graphs.

Dan Li, Huiqiu Lin, Jixiang Meng

Discret. Math., 2023

2022

Neighbor-connectivity of pancake networks and burnt pancake networks.

Na Wang, Jixiang Meng, Yingzhi Tian

Theor. Comput. Sci., 2022

Strongly Menger-edge-connectedness of DCell networks.

Xuemei Liu, Jixiang Meng

Theor. Comput. Sci., 2022

Structure connectivity and substructure connectivity of the directed <i>k</i>-ary <i>n</i>-cube.

Yu Wang, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., 2022

The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees.

Wanping Zhang, Jixiang Meng, Baoyindureng Wu

J. Comb. Optim., 2022

On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs.

Yaoyao Zhang, Jixiang Meng

Discuss. Math. Graph Theory, 2022

Arbitrarily partitionable 2K₂, C₄-free graphs.

Fengxia Liu, Baoyindureng Wu, Jixiang Meng

Discuss. Math. Graph Theory, 2022

Extremal graphs with respect to two distance-based topological indices.

Wanping Zhang, Jixiang Meng, Baoyindureng Wu

Discret. Appl. Math., 2022

On forcibly k-connected and forcibly k-arc-connected digraphic sequences.

Xuemei Liu, Jixiang Meng, Yingzhi Tian

Discret. Appl. Math., 2022

Paths in [h, k]-bipartite hypertournaments.

Hong Yang, Jixiang Meng

Appl. Math. Comput., 2022

Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern.

Na Wang, Jixiang Meng, Yingzhi Tian

Appl. Math. Comput., 2022

Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle.

Hongwei Qiao, Jixiang Meng, Eminjan Sabir

Appl. Math. Comput., 2022

2021

Cyclic connectivity of the data center network.

Hongzhou Zhu, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., 2021

Super extra edge-connectivity in regular networks with edge faults.

Shuang Zhao, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., 2021

Faulty diagnosability and g-extra connectivity of DQcube.

Hong Zhang, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., 2021

Star structure connectivities of pancake graphs and burnt pancake graphs.

Subinur Dilixiati, Eminjan Sabir, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., 2021

Exponential type of many-to-many edge disjoint paths on ternary <i>n</i>-cubes.

Wenhuan Ma, Mingzu Zhang, Jixiang Meng, Tianlong Ma

J. Parallel Distributed Comput., 2021

Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs.

Shuang Zhao, Zongqing Chen, Weihua Yang, Jixiang Meng

J. Comput. Syst. Sci., 2021

Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes.

Eminjan Sabir, Jixiang Meng

Inf. Process. Lett., 2021

The Antistrong Property for Special Digraph Families.

Lili Yuan, Jixiang Meng, Eminjan Sabir

Graphs Comb., 2021

On the Hamilton laceability of double generalized Petersen graphs.

Hongwei Qiao, Jixiang Meng

Discret. Math., 2021

Conditional fractional matching preclusion of n-dimensional torus networks.

Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang

Discret. Appl. Math., 2021

Reliability of DQcube Based on g-Extra Conditional Fault.

Hong Zhang, Jixiang Meng

Comput. J., 2021

Structure Fault Tolerance of Recursive Interconnection Networks.

Eminjan Sabir, Jixiang Meng

Comput. J., 2021

Generalizations of the classics to spanning connectedness.

Eminjan Sabir, Jixiang Meng

Appl. Math. Comput., 2021

On the Dα-spectral radius of two types of graphs.

Rui Qin, Dan Li, Jixiang Meng

Appl. Math. Comput., 2021

The k-restricted edge-connectivity of the data center network DCell.

Xuemei Liu, Jixiang Meng

Appl. Math. Comput., 2021

Sufficient Ore type condition for a digraph to be supereulerian.

Changchang Dong, Jixiang Meng, Juan Liu

Appl. Math. Comput., 2021

2020

Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs.

Peiheng Li, Jixiang Meng

Theor. Comput. Sci., 2020

Cyclic vertex-connectivity of Cartesian product graphs.

Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng

Int. J. Parallel Emergent Distributed Syst., 2020

Hybrid fault diagnosis capability analysis of regular graphs under the PMC model.

Hong Zhang, Laijiang Zhang, Jixiang Meng

Int. J. Comput. Math. Comput. Syst. Theory, 2020

Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs.

Shuang Zhao, Yingzhi Tian, Jixiang Meng

Graphs Comb., 2020

Sufficient conditions for graphs to be spanning connected.

Eminjan Sabir, Jixiang Meng

Appl. Math. Comput., 2020

Structure Fault-tolerance of Arrangement Graphs.

Yafei Lei, Jixiang Meng

Appl. Math. Comput., 2020

Supereulerian 3-path-quasi-transitive digraphs.

Changchang Dong, Juan Liu, Jixiang Meng

Appl. Math. Comput., 2020

2019

Edge fault tolerance of graphs with respect to <i>λ</i>₂-optimal property.

Yaoyao Zhang, Shuang Zhao, Jixiang Meng

Theor. Comput. Sci., 2019

Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity.

Gaoxing Sun, Shuang Zhao, Jixiang Meng

Theor. Comput. Sci., 2019

Parallel routing in regular networks with faults.

Eminjan Sabir, Jixiang Meng

Inf. Process. Lett., 2019

On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs.

Yingzhi Tian, Hong-Jian Lai, Jixiang Meng

Graphs Comb., 2019

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.

Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng

Discret. Math., 2019

Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph.

Xiaomin Hu, Weihua Yang, Yingzhi Tian, Jixiang Meng

Discret. Appl. Math., 2019

Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs.

Shuang Zhao, Jixiang Meng

Comput. J., 2019

Book embedding of complex network with community structure.

Bin Zhao, Wengu Chen, Jixiang Meng, Fengxia Liu

Appl. Math. Comput., 2019

The <i>A_α</i>-spectral radius of trees and unicyclic graphs with given degree sequence.

Dan Li, Yuanyuan Chen, Jixiang Meng

Appl. Math. Comput., 2019

<i>A_α</i>-spectral radius of the second power of a graph.

Yuanyuan Chen, Dan Li, Zhiwen Wang, Jixiang Meng

Appl. Math. Comput., 2019

2018

Structure fault tolerance of hypercubes and folded hypercubes.

Eminjan Sabir, Jixiang Meng

Theor. Comput. Sci., 2018

Strong matching preclusion for <i>k</i>-composition networks.

Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng

Theor. Comput. Sci., 2018

Connectivity keeping stars or double-stars in 2-connected graphs.

Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu

Discret. Math., 2018

Steiner tree packing number and tree connectivity.

Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma

Discret. Math., 2018

Fault Tolerance of λ-Optimal Graphs.

Xing Chen, Wei Xiong, Jixiang Meng

Ars Comb., 2018

Sufficient conditions for hypergraphs to be maximally edge-connected.

Shuang Zhao, Jixiang Meng

Appl. Math. Comput., 2018

Partitioning the Cartesian product of a tree and a cycle.

Fengxia Liu, Baoyindureng Wu, Jixiang Meng

Appl. Math. Comput., 2018

Super <i>R^k</i>-vertex-connectedness.

Xiaomin Hu, Yingzhi Tian, Jixiang Meng

Appl. Math. Comput., 2018

Connectivity of half vertex transitive digraphs.

Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu

Appl. Math. Comput., 2018

2017

Matching preclusion for n-dimensional torus networks.

Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng

Theor. Comput. Sci., 2017

Code for polyomino and computer search of isospectral polyominoes.

Xiaodong Liang, Rui Wang, Jixiang Meng

J. Comb. Optim., 2017

Matching preclusion for k-ary n-cubes with odd k ≥ 3.

Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng

Discret. Appl. Math., 2017

Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs.

Dan Li, Guoping Wang, Jixiang Meng

Appl. Math. Comput., 2017

2016

Strong matching preclusion for n-dimensional torus networks.

Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng

Theor. Comput. Sci., 2016

On the page number of triple-loop networks with even cardinality.

Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian, Jixiang Meng

Ars Comb., 2016

Arc-connectivity of regular digraphs with two orbits.

Qian Xie, Xing Chen, Jixiang Meng

Ars Comb., 2016

Construction of super edge-connected multigraphs with prescribed degrees.

Xianglan Cao, Yingzhi Tian, Jixiang Meng

Ars Comb., 2016

2015

Restricted Connectivity for Some Interconnection Networks.

Yingzhi Tian, Jixiang Meng

Graphs Comb., 2015

Domination in lexicographic product digraphs.

Juan Liu, Xindong Zhang, Jixiang Meng

Ars Comb., 2015

λ'-optimal regular graphs with two orbits.

Huiqiu Lin, Weihua Yang, Jixiang Meng

Ars Comb., 2015

A kind of conditional vertex connectivity of recursive circulants.

Hengzhe Li, Weihua Yang, Jixiang Meng

Ars Comb., 2015

The Harary index of digraphs.

Haining Jiang, Jixiang Meng, Yingzhi Tian

Ars Comb., 2015

cλ-optimally connected mixed Cayley graph.

Luihuan Chen, Jixiang Meng, Yingzhi Tian

Ars Comb., 2015

2014

Reliability analysis of bijective connection networks in terms of the extra edge-connectivity.

Mingzu Zhang, Jixiang Meng, Weihua Yang, Yingzhi Tian

Inf. Sci., 2014

On restricted edge-connectivity of vertex-transitive multigraphs.

Yingzhi Tian, Jixiang Meng

Int. J. Comput. Math., 2014

The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs.

Fengxia Liu, Zhao Zhang, Jixiang Meng

Graphs Comb., 2014

On the existence of super edge-connected graphs with prescribed degrees.

Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang

Discret. Math., 2014

On strongly Z_2s-1-connected graphs.

Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang

Discret. Appl. Math., 2014

Extraconnectivity of Folded Hypercubes.

Weihua Yang, Jixiang Meng

Ars Comb., 2014

On super connectedness and super restricted edge-connectedness of total graphs.

Yingzhi Tian, Jixiang Meng

Ars Comb., 2014

On super restricted edge-connectivity of vertex-transitive graphs.

Yingzhi Tian, Jixiang Meng

Ars Comb., 2014

Local-restricted-edge-connectivity of graphs.

Juan Liu, Xindong Zhang, Jixiang Meng

Ars Comb., 2014

Super-λ Connectivity of Bipartite Graphs.

Xing Chen, Wei Xiong, Jixiang Meng

Ars Comb., 2014

2013

The Diameters of Almost All Bi-Cayley Graphs.

Xingchao Deng, Jixiang Meng

Ars Comb., 2013

Super connectivity and super arc connectivity of the Mycielskian of a digraph.

Xianglan Cao, Litao Guo, Xiaofeng Guo, Jixiang Meng

Ars Comb., 2013

2012

λ-Optimality of Bipartite Digraphs.

Xing Chen, Juan Liu, Jixiang Meng

Inf. Process. Lett., 2012

Inverse degree and super edge-connectivity.

Yingzhi Tian, Litao Guo, Jixiang Meng, Chengfu Qin

Int. J. Comput. Math., 2012

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs.

Yingzhi Tian, Jixiang Meng, Xiaodong Liang

Graphs Comb., 2012

Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees.

Hengzhe Li, Weihua Yang, Jixiang Meng

Discret. Math., 2012

On the connectivity of p-diamond-free vertex transitive graphs.

Yingzhi Tian, Jixiang Meng, Zhao Zhang

Discret. Appl. Math., 2012

Edge fault tolerance of graphs with respect to super edge connectivity.

Yanmei Hong, Jixiang Meng, Zhao Zhang

Discret. Appl. Math., 2012

Graph Eigenvalues Under a Graph Transformation.

Hua Zou, Jixiang Meng

Ars Comb., 2012

The Properties of Transformation Digraphs D^xyz.

Xiujuan Zhang, Juan Liu, Yan Long, Jixiang Meng

Ars Comb., 2012

The Transformation Digraph D^++-.

Juan Liu, Jixiang Meng, Xindong Zhang

Ars Comb., 2012

Domination number in iterated line digraph of a complete bipartite digraph.

Huiping Cai, Juan Liu, Jixiang Meng

Ars Comb., 2012

Generalized measures of fault tolerance in hypercube networks.

Weihua Yang, Jixiang Meng

Appl. Math. Lett., 2012

Super restricted edge connectivity of regular graphs with two orbits.

Huiqiu Lin, Jixiang Meng, Weihua Yang

Appl. Math. Comput., 2012

2011

On domination number of Cartesian product of directed paths.

Juan Liu, Xindong Zhang, Jixiang Meng

J. Comb. Optim., 2011

Superconnected and Hyperconnected Small Degree Transitive Graphs.

Yingzhi Tian, Jixiang Meng

Graphs Comb., 2011

Gaussian integral circulant digraphs.

Ying Xu, Jixiang Meng

Discret. Math., 2011

Total restrained domination in graphs.

Xing Chen, Juan Liu, Jixiang Meng

Comput. Math. Appl., 2011

Domination in lexicographic product graphs.

Xindong Zhang, Juan Liu, Jixiang Meng

Ars Comb., 2011

The Properties of Middle Digraphs.

Juan Liu, Xindong Zhang, Jixiang Meng

Ars Comb., 2011

λ^′-optimally connected mixed Cayley graphs.

Yingzhi Tian, Jixiang Meng

Appl. Math. Lett., 2011

2010

Domination number of Cartesian products of directed cycles.

Xindong Zhang, Juan Liu, Xing Chen, Jixiang Meng

Inf. Process. Lett., 2010

Conditional connectivity of Cayley graphs generated by transposition trees.

Weihua Yang, Hengzhe Li, Jixiang Meng

Inf. Process. Lett., 2010

On domination number of Cartesian product of directed cycles.

Juan Liu, Xindong Zhang, Xing Chen, Jixiang Meng

Inf. Process. Lett., 2010

On super restricted edge-connectivity of edge-transitive graphs.

Yingzhi Tian, Jixiang Meng

Discret. Math., 2010

Double-super-connected digraphs.

Juan Liu, Jixiang Meng, Zhao Zhang

Discret. Appl. Math., 2010

Extraconnectivity of Cartesian product graphs of paths.

Mingyan Fu, Weihua Yang, Jixiang Meng

Ars Comb., 2010

Coloring and the Lovász Local Lemma.

Xing Chen, Zhihua Du, Jixiang Meng

Appl. Math. Lett., 2010

Extraconnectivity of hypercubes (II).

Weihua Yang, Jixiang Meng

Australas. J Comb., 2010

2009

Application of modified homotopy perturbation method for solving the augmented systems.

Xinlong Feng, Yinnian He, Jixiang Meng

J. Comput. Appl. Math., 2009

The bondage number in complete t-partite digraphs.

Xindong Zhang, Juan Liu, Jixiang Meng

Inf. Process. Lett., 2009

lambda_c-Optimally half vertex transitive graphs with regularity k.

Yingzhi Tian, Jixiang Meng

Inf. Process. Lett., 2009

Super restricted edge connected Cartesian product graphs.

Juan Liu, Xing Chen, Jixiang Meng

Inf. Process. Lett., 2009

The restricted arc connectivity of Cartesian product digraphs.

Xing Chen, Juan Liu, Jixiang Meng

Inf. Process. Lett., 2009

Super edge-connectivity of mixed Cayley graph.

Jinyang Chen, Jixiang Meng, Lihong Huang

Discret. Math., 2009

Super-connected arc-transitive digraphs.

Jixiang Meng, Zhao Zhang

Discret. Appl. Math., 2009

Some Algebraic Properties of Bi-Circulant Digraphs.

Ying Xu, Jixiang Meng

Ars Comb., 2009

On the Folded hypercube and Bi-folded Hypercube.

Ying Xu, Jixiang Meng

Ars Comb., 2009

A diameter formula for an undirected double-loop network.

Bao-Xing Chen, Jixiang Meng, Wenjun Xiao

Ars Comb., 2009

Embedding connected double-loop networks with even cardinality in books.

Weihua Yang, Jixiang Meng

Appl. Math. Lett., 2009

Extraconnectivity of hypercubes.

Weihua Yang, Jixiang Meng

Appl. Math. Lett., 2009

A line digraph of a complete bipartite digraph.

Juan Liu, Lin Sun, Jixiang Meng

Appl. Math. Lett., 2009

2008

Super-connected and super-arc-connected Cartesian product of digraphs.

Juan Liu, Jixiang Meng

Inf. Process. Lett., 2008

Reversals Cayley graphs of symmetric groups.

Rui Li, Jixiang Meng

Inf. Process. Lett., 2008

Edge-connectivity of regular graphs with two orbits.

Fengxia Liu, Jixiang Meng

Discret. Math., 2008

Super-connected edge transitive graphs.

Zhao Zhang, Jixiang Meng

Discret. Appl. Math., 2008

Super-Arc-Connected and Super-Connected Total Digraphs.

Juan Liu, Jixiang Meng

Ars Comb., 2008

Connectivity of bi-Cayley Graphs.

Xiaodong Liang, Jixiang Meng

Ars Comb., 2008

2007

Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs.

Xiaodong Liang, Jixiang Meng, Zhao Zhang

Graphs Comb., 2007

Connectivity of Connected Bipartite Graphs with Two Orbits.

Xiaodong Liang, Jixiang Meng

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

Some new optimal and suboptimal infinite families of undirected double-loop networks.

Bao-Xing Chen, Jixiang Meng, Wenjun Xiao

Discret. Math. Theor. Comput. Sci., 2006

Semi-hyper-connected edge transitive graphs.

Zhao Zhang, Jixiang Meng

Discret. Math., 2006

On optimally-<i>lambda</i>⁽³⁾ transitive graphs.

Zhao Zhang, Jixiang Meng

Discret. Appl. Math., 2006

Restricted Edge Connectivity of Edge Transitive Graphs.

Zhao Zhang, Jixiang Meng

Ars Comb., 2006

2005

A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks.

Bao-Xing Chen, Jixiang Meng, Wenjun Xiao

Proceedings of the Mobile Ad-hoc and Sensor Networks, First International Conference, 2005

2004

Hamiltonian jump graphs.

Baoyindureng Wu, Jixiang Meng

Discret. Math., 2004

2003

Number of minimum vertex cuts in transitive graphs.

Jixiang Meng, Zhao Zhang

Discret. Math., 2003

Optimally super-edge-connected transitive graphs.

Jixiang Meng

Discret. Math., 2003

Connectivity of Vertex and Edge Transitive Graphs.

Jixiang Meng

Discret. Appl. Math., 2003

2002

On a kind of restricted edge connectivity of graphs.

Jixiang Meng, Youhu Ji

Discret. Appl. Math., 2002

2000

A Classification of <i>DCI(CI)</i>-Subsets for Cyclic Group of Odd Prime Power Order.

Qiongxiang Huang, Jixiang Meng

J. Comb. Theory B, 2000

Normal Minimal Cayley Digraphs of Abelian Groups.

Jixiang Meng, Bao Ying

Eur. J. Comb., 2000

A classification of 2-arc-transitive circulant digraphs.

Jixiang Meng, Jianzhong Wang

Discret. Math., 2000

1998

On the isomorphism problem of Cayley graphs of Abelian groups.

Jixiang Meng, Mingyao Xu

Discret. Math., 1998

Almost all Cayley graphs have diameter 2.

Jixiang Meng, Qiongxiang Huang

Discret. Math., 1998

1997

The Automorphism Groups of Minimal Infinite Circulant Digraphs.

Jixiang Meng, Qiongxiang Huang

Eur. J. Comb., 1997

The Exponent of the Primitive Cayley Digraphs on Finite Abelian Groups.

Jian-Zhong Wang, Jixiang Meng

Discret. Appl. Math., 1997

1996

On the isomorphisms and automorphism groups of circulants.

Qiongxiang Huang, Jixiang Meng

Graphs Comb., 1996

Weakly 3-DCI abelian groups.

Mingyao Xu, Jixiang Meng

Australas. J Comb., 1996

Superconnectivity for Minimal Multi-loop Networks.

Jixiang Meng

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

The generalized S-graphs of diameter 3.

Jixiang Meng

Discret. Math., 1995

Automorphisms of groups and isomorphisms of Cayley digraphs.

Jixiang Meng, Mingyao Xu

Australas. J Comb., 1995

Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups.

Jixiang Meng

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995