Jixiang Meng

ORCID

Publication Activity (10 Years)

Years Active: 1995-2025
Publications (10 Years): 95

Top Venues

Publications

Dan Li, Minghui Yan, Jixiang Meng
Minimizing the least Laplacian eigenvalue of signed complete graphs. Appl. Math. Comput. 484 (2025)
Eminjan Sabir, Jianxi Fan, Jixiang Meng, Baolei Cheng
Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks. IEEE Trans. Reliab. 73 (1) (2024)
Yuanyuan Chen, Dan Li, Huiqiu Lin, Jixiang Meng
Some graphs determined by their Aα-spectra. Discret. Appl. Math. 348 (2024)
Bin Zhao, Peng Li, Jixiang Meng, Yuepeng Zhang
Using Euler's Formula to Find the Lower Bound of the Page Number. Graphs Comb. 40 (3) (2024)
Eminjan Sabir, Jixiang Meng, Hongwei Qiao
On spanning laceability of bipartite graphs. Appl. Math. Comput. 480 (2024)
Zhaolin Teng, Dan Li, Yuanyuan Chen, Jixiang Meng
Unbalanced signed bicyclic graphs minimizing the least eigenvalue. Appl. Math. Comput. 466 (2024)
Changchang Dong, Jixiang Meng, Juan Liu
Dominated pair degree sum conditions of supereulerian digraphs. Discuss. Math. Graph Theory 44 (3) (2024)
Hong Yang, Juan Liu, Jixiang Meng
Antidirected spanning closed trail in tournaments. Appl. Math. Comput. 462 (2024)
Hongwei Qiao, Jixiang Meng, Eminjan Sabir
The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree. Discret. Appl. Math. 356 (2024)
Na Wang, Jixiang Meng, Yingzhi Tian
Reliability analyses of regular graphs based on edge-structure connectivity. Discret. Appl. Math. 356 (2024)
Yayu Yang, Mingzu Zhang, Jixiang Meng
-component edge-connectivity. Appl. Math. Comput. 462 (2024)
Lili Yuan, Jixiang Meng
Ore conditions for antistrong digraphs. Appl. Math. Comput. 457 (2023)
Yayu Yang, Mingzu Zhang, Jixiang Meng
-component edge-connectivity. J. Parallel Distributed Comput. 173 (2023)
Xuemei Liu, Jixiang Meng, Yingzhi Tian
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences. J. Supercomput. 79 (14) (2023)
Lili Yuan, Jixiang Meng
Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian. Graphs Comb. 39 (2) (2023)
Yayu Yang, Mingzu Zhang, Jixiang Meng, Rongda Chen
-average Degree Edge-Connectivity of Bijective Connection Networks. Comput. J. 66 (9) (2023)
Hong Yang, Juan Liu, Jixiang Meng
-Stable Number 2. Graphs Comb. 39 (4) (2023)
Yayu Yang, Mingzu Zhang, Jixiang Meng
-cube. Int. J. Parallel Emergent Distributed Syst. 38 (3) (2023)
Hongwei Qiao, Jixiang Meng, Eminjan Sabir
The edge fault-tolerant spanning laceability of the enhanced hypercube networks. J. Supercomput. 79 (6) (2023)
Xuemei Liu, Jixiang Meng, Eminjan Sabir
Component connectivity of the data center network DCell. Appl. Math. Comput. 444 (2023)
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs. Discuss. Math. Graph Theory 43 (1) (2023)
Yu Wang, Jixiang Meng
-cube. Theor. Comput. Sci. 947 (2023)
Hongwei Qiao, Eminjan Sabir, Jixiang Meng
The spanning cyclability of Cayley graphs generated by transposition trees. Discret. Appl. Math. 328 (2023)
Eminjan Sabir, Jixiang Meng
Degree sequence conditions for a graph to be disjoint path coverable. Discret. Appl. Math. 332 (2023)
Hongwei Qiao, Jixiang Meng
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes. Theor. Comput. Sci. 958 (2023)
Dan Li, Huiqiu Lin, Jixiang Meng
Extremal spectral results related to spanning trees of signed complete graphs. Discret. Math. 346 (2) (2023)
Yihong Wang, Jixiang Meng, Jianxi Fan
Reliabilities for two kinds of graphs with smaller diameters. Appl. Math. Comput. 446 (2023)
Wanping Zhang, Jixiang Meng, Na Wang
Extremal Graphs for Sombor Index with Given Parameters. Axioms 12 (2) (2023)
Na Wang, Jixiang Meng, Yingzhi Tian
Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern. Appl. Math. Comput. 430 (2022)
Xuemei Liu, Jixiang Meng
Strongly Menger-edge-connectedness of DCell networks. Theor. Comput. Sci. 922 (2022)
Xuemei Liu, Jixiang Meng, Yingzhi Tian
On forcibly k-connected and forcibly k-arc-connected digraphic sequences. Discret. Appl. Math. 321 (2022)
Na Wang, Jixiang Meng, Yingzhi Tian
Neighbor-connectivity of pancake networks and burnt pancake networks. Theor. Comput. Sci. 916 (2022)
Hongwei Qiao, Jixiang Meng, Eminjan Sabir
Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle. Appl. Math. Comput. 435 (2022)
Wanping Zhang, Jixiang Meng, Baoyindureng Wu
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees. J. Comb. Optim. 44 (2) (2022)
Hong Yang, Jixiang Meng
Paths in [h, k]-bipartite hypertournaments. Appl. Math. Comput. 423 (2022)
Yaoyao Zhang, Jixiang Meng
On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs. Discuss. Math. Graph Theory 42 (2) (2022)
Fengxia Liu, Baoyindureng Wu, Jixiang Meng
-free graphs. Discuss. Math. Graph Theory 42 (2) (2022)
Wanping Zhang, Jixiang Meng, Baoyindureng Wu
Extremal graphs with respect to two distance-based topological indices. Discret. Appl. Math. 317 (2022)
Yu Wang, Jixiang Meng
-cube. Int. J. Parallel Emergent Distributed Syst. 37 (6) (2022)
Eminjan Sabir, Jixiang Meng
Structure Fault Tolerance of Recursive Interconnection Networks. Comput. J. 64 (1) (2021)
Wenhuan Ma, Mingzu Zhang, Jixiang Meng, Tianlong Ma
-cubes. J. Parallel Distributed Comput. 158 (2021)
Subinur Dilixiati, Eminjan Sabir, Jixiang Meng
Star structure connectivities of pancake graphs and burnt pancake graphs. Int. J. Parallel Emergent Distributed Syst. 36 (5) (2021)
Shuang Zhao, Zongqing Chen, Weihua Yang, Jixiang Meng
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs. J. Comput. Syst. Sci. 115 (2021)
Xuemei Liu, Jixiang Meng
The k-restricted edge-connectivity of the data center network DCell. Appl. Math. Comput. 396 (2021)
Hong Zhang, Jixiang Meng
Reliability of DQcube Based on g-Extra Conditional Fault. Comput. J. 64 (9) (2021)
Lili Yuan, Jixiang Meng, Eminjan Sabir
The Antistrong Property for Special Digraph Families. Graphs Comb. 37 (6) (2021)
Changchang Dong, Jixiang Meng, Juan Liu
Sufficient Ore type condition for a digraph to be supereulerian. Appl. Math. Comput. 410 (2021)
Eminjan Sabir, Jixiang Meng
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes. Inf. Process. Lett. 172 (2021)
Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang
Conditional fractional matching preclusion of n-dimensional torus networks. Discret. Appl. Math. 293 (2021)
Hongwei Qiao, Jixiang Meng
On the Hamilton laceability of double generalized Petersen graphs. Discret. Math. 344 (9) (2021)
Hong Zhang, Jixiang Meng
Faulty diagnosability and g-extra connectivity of DQcube. Int. J. Parallel Emergent Distributed Syst. 36 (3) (2021)
Rui Qin, Dan Li, Jixiang Meng
On the Dα-spectral radius of two types of graphs. Appl. Math. Comput. 396 (2021)
Shuang Zhao, Jixiang Meng
Super extra edge-connectivity in regular networks with edge faults. Int. J. Parallel Emergent Distributed Syst. 36 (3) (2021)
Eminjan Sabir, Jixiang Meng
Generalizations of the classics to spanning connectedness. Appl. Math. Comput. 403 (2021)
Hongzhou Zhu, Jixiang Meng
Cyclic connectivity of the data center network. Int. J. Parallel Emergent Distributed Syst. 36 (6) (2021)
Peiheng Li, Jixiang Meng
Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs. Theor. Comput. Sci. 847 (2020)
Yafei Lei, Jixiang Meng
Structure Fault-tolerance of Arrangement Graphs. Appl. Math. Comput. 381 (2020)
Hong Zhang, Laijiang Zhang, Jixiang Meng
Hybrid fault diagnosis capability analysis of regular graphs under the PMC model. Int. J. Comput. Math. Comput. Syst. Theory 5 (2) (2020)
Shuang Zhao, Yingzhi Tian, Jixiang Meng
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs. Graphs Comb. 36 (4) (2020)
Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng
Cyclic vertex-connectivity of Cartesian product graphs. Int. J. Parallel Emergent Distributed Syst. 35 (1) (2020)
Eminjan Sabir, Jixiang Meng
Sufficient conditions for graphs to be spanning connected. Appl. Math. Comput. 378 (2020)
Changchang Dong, Juan Liu, Jixiang Meng
Supereulerian 3-path-quasi-transitive digraphs. Appl. Math. Comput. 372 (2020)
Eminjan Sabir, Jixiang Meng
Parallel routing in regular networks with faults. Inf. Process. Lett. 142 (2019)
Xiaomin Hu, Weihua Yang, Yingzhi Tian, Jixiang Meng
Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph. Discret. Appl. Math. 262 (2019)
Yuanyuan Chen, Dan Li, Zhiwen Wang, Jixiang Meng
-spectral radius of the second power of a graph. Appl. Math. Comput. 359 (2019)
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discret. Math. 342 (2) (2019)
Bin Zhao, Wengu Chen, Jixiang Meng, Fengxia Liu
Book embedding of complex network with community structure. Appl. Math. Comput. 361 (2019)
Shuang Zhao, Jixiang Meng
Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs. Comput. J. 62 (5) (2019)
Dan Li, Yuanyuan Chen, Jixiang Meng
-spectral radius of trees and unicyclic graphs with given degree sequence. Appl. Math. Comput. 363 (2019)
Gaoxing Sun, Shuang Zhao, Jixiang Meng
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity. Theor. Comput. Sci. 758 (2019)
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35 (5) (2019)
Yaoyao Zhang, Shuang Zhao, Jixiang Meng
-optimal property. Theor. Comput. Sci. 783 (2019)
Shuang Zhao, Jixiang Meng
Sufficient conditions for hypergraphs to be maximally edge-connected. Appl. Math. Comput. 333 (2018)
Eminjan Sabir, Jixiang Meng
Structure fault tolerance of hypercubes and folded hypercubes. Theor. Comput. Sci. 711 (2018)
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341 (4) (2018)
Fengxia Liu, Baoyindureng Wu, Jixiang Meng
Partitioning the Cartesian product of a tree and a cycle. Appl. Math. Comput. 332 (2018)
Xing Chen, Wei Xiong, Jixiang Meng
Fault Tolerance of λ-Optimal Graphs. Ars Comb. 138 (2018)
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
-composition networks. Theor. Comput. Sci. 711 (2018)
Xiaomin Hu, Yingzhi Tian, Jixiang Meng
-vertex-connectedness. Appl. Math. Comput. 339 (2018)
Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma
Steiner tree packing number and tree connectivity. Discret. Math. 341 (7) (2018)
Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu
Connectivity of half vertex transitive digraphs. Appl. Math. Comput. 316 (2018)
Xiaodong Liang, Rui Wang, Jixiang Meng
Code for polyomino and computer search of isospectral polyominoes. J. Comb. Optim. 33 (1) (2017)
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
Matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 687 (2017)
Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng
Matching preclusion for k-ary n-cubes with odd k ≥ 3. Discret. Appl. Math. 229 (2017)
Dan Li, Guoping Wang, Jixiang Meng
Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs. Appl. Math. Comput. 293 (2017)
Xianglan Cao, Yingzhi Tian, Jixiang Meng
Construction of super edge-connected multigraphs with prescribed degrees. Ars Comb. 127 (2016)
Qian Xie, Xing Chen, Jixiang Meng
Arc-connectivity of regular digraphs with two orbits. Ars Comb. 125 (2016)
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
Strong matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 635 (2016)
Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian, Jixiang Meng
On the page number of triple-loop networks with even cardinality. Ars Comb. 124 (2016)
Luihuan Chen, Jixiang Meng, Yingzhi Tian
cλ-optimally connected mixed Cayley graph. Ars Comb. 121 (2015)
Huiqiu Lin, Weihua Yang, Jixiang Meng
λ'-optimal regular graphs with two orbits. Ars Comb. 121 (2015)
Yingzhi Tian, Jixiang Meng
Restricted Connectivity for Some Interconnection Networks. Graphs Comb. 31 (5) (2015)
Juan Liu, Xindong Zhang, Jixiang Meng
Domination in lexicographic product digraphs. Ars Comb. 120 (2015)
Haining Jiang, Jixiang Meng, Yingzhi Tian
The Harary index of digraphs. Ars Comb. 123 (2015)
Hengzhe Li, Weihua Yang, Jixiang Meng
A kind of conditional vertex connectivity of recursive circulants. Ars Comb. 122 (2015)
Xing Chen, Wei Xiong, Jixiang Meng
Super-λ Connectivity of Bipartite Graphs. Ars Comb. 117 (2014)
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang
On the existence of super edge-connected graphs with prescribed degrees. Discret. Math. 328 (2014)
Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang
-connected graphs. Discret. Appl. Math. 174 (2014)
Juan Liu, Xindong Zhang, Jixiang Meng
Local-restricted-edge-connectivity of graphs. Ars Comb. 113 (2014)
Fengxia Liu, Zhao Zhang, Jixiang Meng
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. Graphs Comb. 30 (3) (2014)

Jixiang Meng.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jixiang Meng