default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJixiang Meng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j176]Dan Li, Minghui Yan, Jixiang Meng:
Minimizing the least Laplacian eigenvalue of signed complete graphs. Appl. Math. Comput. 484: 129002 (2025)- [j175]Hongwei Qiao, Jixiang Meng
:
Disjoint path covers of star graphs. Appl. Math. Comput. 487: 129098 (2025) - 2024
- [j174]Hong Yang, Juan Liu, Jixiang Meng:
Antidirected spanning closed trail in tournaments. Appl. Math. Comput. 462: 128336 (2024) - [j173]Yayu Yang, Mingzu Zhang, Jixiang Meng:
Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity. Appl. Math. Comput. 462: 128343 (2024) - [j172]Zhaolin Teng, Dan Li, Yuanyuan Chen, Jixiang Meng:
Unbalanced signed bicyclic graphs minimizing the least eigenvalue. Appl. Math. Comput. 466: 128478 (2024) - [j171]Eminjan Sabir, Jixiang Meng, Hongwei Qiao:
On spanning laceability of bipartite graphs. Appl. Math. Comput. 480: 128919 (2024) - [j170]Yuanyuan Chen, Dan Li, Huiqiu Lin, Jixiang Meng:
Some graphs determined by their Aα-spectra. Discret. Appl. Math. 348: 46-55 (2024) - [j169]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: 174-181 (2024) - [j168]Na Wang, Jixiang Meng, Yingzhi Tian:
Reliability analyses of regular graphs based on edge-structure connectivity. Discret. Appl. Math. 356: 329-342 (2024) - [j167]Changchang Dong, Jixiang Meng, Juan Liu:
Dominated pair degree sum conditions of supereulerian digraphs. Discuss. Math. Graph Theory 44(3): 879 (2024) - [j166]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): 44 (2024) - [j165]Guoqiang Xie, Jixiang Meng:
The Strong Menger Connectivity of the Directed k-Ary n-Cube. J. Interconnect. Networks 24(2): 2350012:1-2350012:11 (2024) - [j164]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): 257-269 (2024) - 2023
- [j163]Xuemei Liu, Jixiang Meng, Eminjan Sabir:
Component connectivity of the data center network DCell. Appl. Math. Comput. 444: 127822 (2023) - [j162]Yihong Wang, Jixiang Meng, Jianxi Fan:
Reliabilities for two kinds of graphs with smaller diameters. Appl. Math. Comput. 446: 127874 (2023) - [j161]Lili Yuan, Jixiang Meng:
Ore conditions for antistrong digraphs. Appl. Math. Comput. 457: 128181 (2023) - [j160]Wanping Zhang, Jixiang Meng, Na Wang:
Extremal Graphs for Sombor Index with Given Parameters. Axioms 12(2): 203 (2023) - [j159]Yayu Yang, Mingzu Zhang, Jixiang Meng, Rongda Chen:
The a-average Degree Edge-Connectivity of Bijective Connection Networks. Comput. J. 66(9): 2118-2122 (2023) - [j158]Hongwei Qiao, Eminjan Sabir, Jixiang Meng:
The spanning cyclability of Cayley graphs generated by transposition trees. Discret. Appl. Math. 328: 60-69 (2023) - [j157]Eminjan Sabir, Jixiang Meng:
Degree sequence conditions for a graph to be disjoint path coverable. Discret. Appl. Math. 332: 62-69 (2023) - [j156]Dan Li, Huiqiu Lin, Jixiang Meng:
Extremal spectral results related to spanning trees of signed complete graphs. Discret. Math. 346(2): 113250 (2023) - [j155]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): 179-194 (2023) - [j154]Lili Yuan, Jixiang Meng:
Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian. Graphs Comb. 39(2): 22 (2023) - [j153]Hong Yang, Juan Liu, Jixiang Meng:
Antidirected Hamiltonian Paths and Cycles of Digraphs with α 2-Stable Number 2. Graphs Comb. 39(4): 73 (2023) - [j152]Yayu Yang, Mingzu Zhang, Jixiang Meng:
Fault tolerance analysis for hamming graphs with large-scale faulty links based on k-component edge-connectivity. J. Parallel Distributed Comput. 173: 107-114 (2023) - [j151]Yayu Yang, Mingzu Zhang, Jixiang Meng:
The generalized measure of edge fault tolerance in exchanged 3-ary n-cube. Int. J. Parallel Emergent Distributed Syst. 38(3): 173-180 (2023) - [j150]Yu Wang, Jixiang Meng:
Structure fault-tolerance of divide-and-swap k-ary n-cube. Theor. Comput. Sci. 947: 113704 (2023) - [j149]Hongwei Qiao, Jixiang Meng:
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes. Theor. Comput. Sci. 958: 113860 (2023) - [j148]Hongwei Qiao, Jixiang Meng, Eminjan Sabir:
The edge fault-tolerant spanning laceability of the enhanced hypercube networks. J. Supercomput. 79(6): 6070-6086 (2023) - [j147]Xuemei Liu, Jixiang Meng, Yingzhi Tian:
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences. J. Supercomput. 79(14): 15980-15996 (2023) - 2022
- [j146]Hong Yang, Jixiang Meng:
Paths in [h, k]-bipartite hypertournaments. Appl. Math. Comput. 423: 127005 (2022) - [j145]Na Wang, Jixiang Meng, Yingzhi Tian:
Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern. Appl. Math. Comput. 430: 127257 (2022) - [j144]Hongwei Qiao, Jixiang Meng, Eminjan Sabir:
Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle. Appl. Math. Comput. 435: 127481 (2022) - [j143]Wanping Zhang, Jixiang Meng, Baoyindureng Wu:
Extremal graphs with respect to two distance-based topological indices. Discret. Appl. Math. 317: 63-74 (2022) - [j142]Xuemei Liu, Jixiang Meng, Yingzhi Tian:
On forcibly k-connected and forcibly k-arc-connected digraphic sequences. Discret. Appl. Math. 321: 10-18 (2022) - [j141]Yaoyao Zhang, Jixiang Meng:
On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs. Discuss. Math. Graph Theory 42(2): 321-332 (2022) - [j140]Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Arbitrarily partitionable 2K2, C4-free graphs. Discuss. Math. Graph Theory 42(2): 485-500 (2022) - [j139]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): 1199-1220 (2022) - [j138]Yu Wang, Jixiang Meng:
Structure connectivity and substructure connectivity of the directed k-ary n-cube. Int. J. Parallel Emergent Distributed Syst. 37(6): 649-658 (2022) - [j137]Na Wang, Jixiang Meng, Yingzhi Tian:
Neighbor-connectivity of pancake networks and burnt pancake networks. Theor. Comput. Sci. 916: 31-39 (2022) - [j136]Xuemei Liu, Jixiang Meng:
Strongly Menger-edge-connectedness of DCell networks. Theor. Comput. Sci. 922: 308-311 (2022) - 2021
- [j135]Rui Qin, Dan Li, Jixiang Meng:
On the Dα-spectral radius of two types of graphs. Appl. Math. Comput. 396: 125898 (2021) - [j134]Xuemei Liu, Jixiang Meng:
The k-restricted edge-connectivity of the data center network DCell. Appl. Math. Comput. 396: 125941 (2021) - [j133]Eminjan Sabir, Jixiang Meng:
Generalizations of the classics to spanning connectedness. Appl. Math. Comput. 403: 126167 (2021) - [j132]Changchang Dong, Jixiang Meng, Juan Liu:
Sufficient Ore type condition for a digraph to be supereulerian. Appl. Math. Comput. 410: 126470 (2021) - [j131]Eminjan Sabir, Jixiang Meng:
Structure Fault Tolerance of Recursive Interconnection Networks. Comput. J. 64(1): 64-75 (2021) - [j130]Hong Zhang, Jixiang Meng:
Reliability of DQcube Based on g-Extra Conditional Fault. Comput. J. 64(9): 1393-1400 (2021) - [j129]Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang:
Conditional fractional matching preclusion of n-dimensional torus networks. Discret. Appl. Math. 293: 157-165 (2021) - [j128]Hongwei Qiao, Jixiang Meng:
On the Hamilton laceability of double generalized Petersen graphs. Discret. Math. 344(9): 112478 (2021) - [j127]Lili Yuan, Jixiang Meng, Eminjan Sabir:
The Antistrong Property for Special Digraph Families. Graphs Comb. 37(6): 2511-2519 (2021) - [j126]Eminjan Sabir, Jixiang Meng:
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes. Inf. Process. Lett. 172: 106160 (2021) - [j125]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: 64-72 (2021) - [j124]Wenhuan Ma, Mingzu Zhang, Jixiang Meng, Tianlong Ma:
Exponential type of many-to-many edge disjoint paths on ternary n-cubes. J. Parallel Distributed Comput. 158: 67-79 (2021) - [j123]Hong Zhang, Jixiang Meng:
Faulty diagnosability and g-extra connectivity of DQcube. Int. J. Parallel Emergent Distributed Syst. 36(3): 189-198 (2021) - [j122]Shuang Zhao, Jixiang Meng:
Super extra edge-connectivity in regular networks with edge faults. Int. J. Parallel Emergent Distributed Syst. 36(3): 240-250 (2021) - [j121]Subinur Dilixiati, Eminjan Sabir, Jixiang Meng:
Star structure connectivities of pancake graphs and burnt pancake graphs. Int. J. Parallel Emergent Distributed Syst. 36(5): 440-448 (2021) - [j120]Hongzhou Zhu, Jixiang Meng:
Cyclic connectivity of the data center network. Int. J. Parallel Emergent Distributed Syst. 36(6): 623-629 (2021) - 2020
- [j119]Changchang Dong, Juan Liu, Jixiang Meng:
Supereulerian 3-path-quasi-transitive digraphs. Appl. Math. Comput. 372 (2020) - [j118]Eminjan Sabir, Jixiang Meng:
Sufficient conditions for graphs to be spanning connected. Appl. Math. Comput. 378: 125198 (2020) - [j117]Yafei Lei, Jixiang Meng:
Structure Fault-tolerance of Arrangement Graphs. Appl. Math. Comput. 381: 125287 (2020) - [j116]Shuang Zhao, Yingzhi Tian, Jixiang Meng:
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs. Graphs Comb. 36(4): 1065-1078 (2020) - [j115]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): 61-71 (2020) - [j114]Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng:
Cyclic vertex-connectivity of Cartesian product graphs. Int. J. Parallel Emergent Distributed Syst. 35(1): 81-90 (2020) - [j113]Peiheng Li, Jixiang Meng:
Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs. Theor. Comput. Sci. 847: 95-102 (2020)
2010 – 2019
- 2019
- [j112]Yuanyuan Chen, Dan Li, Zhiwen Wang, Jixiang Meng:
Aα-spectral radius of the second power of a graph. Appl. Math. Comput. 359: 418-425 (2019) - [j111]Bin Zhao, Wengu Chen, Jixiang Meng, Fengxia Liu:
Book embedding of complex network with community structure. Appl. Math. Comput. 361: 747-751 (2019) - [j110]Dan Li, Yuanyuan Chen, Jixiang Meng:
The Aα-spectral radius of trees and unicyclic graphs with given degree sequence. Appl. Math. Comput. 363 (2019) - [j109]Shuang Zhao, Jixiang Meng:
Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs. Comput. J. 62(5): 706-714 (2019) - [j108]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: 96-103 (2019) - [j107]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): 344-351 (2019) - [j106]Yingzhi Tian, Hong-Jian Lai, Jixiang Meng:
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35(5): 1001-1010 (2019) - [j105]Eminjan Sabir, Jixiang Meng:
Parallel routing in regular networks with faults. Inf. Process. Lett. 142: 84-89 (2019) - [j104]Gaoxing Sun, Shuang Zhao, Jixiang Meng:
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity. Theor. Comput. Sci. 758: 9-16 (2019) - [j103]Yaoyao Zhang, Shuang Zhao, Jixiang Meng:
Edge fault tolerance of graphs with respect to λ2-optimal property. Theor. Comput. Sci. 783: 95-104 (2019) - 2018
- [j102]Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu:
Connectivity of half vertex transitive digraphs. Appl. Math. Comput. 316: 25-29 (2018) - [j101]Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Partitioning the Cartesian product of a tree and a cycle. Appl. Math. Comput. 332: 90-95 (2018) - [j100]Shuang Zhao, Jixiang Meng:
Sufficient conditions for hypergraphs to be maximally edge-connected. Appl. Math. Comput. 333: 362-368 (2018) - [j99]Xiaomin Hu, Yingzhi Tian, Jixiang Meng:
Super Rk-vertex-connectedness. Appl. Math. Comput. 339: 812-819 (2018) - [j98]Xing Chen, Wei Xiong, Jixiang Meng:
Fault Tolerance of λ-Optimal Graphs. Ars Comb. 138: 355-364 (2018) - [j97]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu:
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341(4): 1120-1124 (2018) - [j96]Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma:
Steiner tree packing number and tree connectivity. Discret. Math. 341(7): 1945-1951 (2018) - [j95]Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Strong matching preclusion for k-composition networks. Theor. Comput. Sci. 711: 36-43 (2018) - [j94]Eminjan Sabir, Jixiang Meng:
Structure fault tolerance of hypercubes and folded hypercubes. Theor. Comput. Sci. 711: 44-55 (2018) - 2017
- [j93]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: 218-225 (2017) - [j92]Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng:
Matching preclusion for k-ary n-cubes with odd k ≥ 3. Discret. Appl. Math. 229: 90-100 (2017) - [j91]Xiaodong Liang, Rui Wang, Jixiang Meng:
Code for polyomino and computer search of isospectral polyominoes. J. Comb. Optim. 33(1): 254-264 (2017) - [j90]Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 687: 40-47 (2017) - 2016
- [j89]Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian, Jixiang Meng:
On the page number of triple-loop networks with even cardinality. Ars Comb. 124: 257-266 (2016) - [j88]Qian Xie, Xing Chen, Jixiang Meng:
Arc-connectivity of regular digraphs with two orbits. Ars Comb. 125: 3-10 (2016) - [j87]Xianglan Cao, Yingzhi Tian, Jixiang Meng:
Construction of super edge-connected multigraphs with prescribed degrees. Ars Comb. 127: 3-13 (2016) - [j86]Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Strong matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 635: 64-73 (2016) - 2015
- [j85]Juan Liu, Xindong Zhang, Jixiang Meng:
Domination in lexicographic product digraphs. Ars Comb. 120: 23-32 (2015) - [j84]Luihuan Chen, Jixiang Meng, Yingzhi Tian:
cλ-optimally connected mixed Cayley graph. Ars Comb. 121: 3-17 (2015) - [j83]Huiqiu Lin, Weihua Yang, Jixiang Meng:
λ'-optimal regular graphs with two orbits. Ars Comb. 121: 175-185 (2015) - [j82]Hengzhe Li, Weihua Yang, Jixiang Meng:
A kind of conditional vertex connectivity of recursive circulants. Ars Comb. 122: 3-12 (2015) - [j81]Haining Jiang, Jixiang Meng, Yingzhi Tian:
The Harary index of digraphs. Ars Comb. 123: 115-124 (2015) - [j80]Yingzhi Tian, Jixiang Meng:
Restricted Connectivity for Some Interconnection Networks. Graphs Comb. 31(5): 1727-1737 (2015) - 2014
- [j79]Juan Liu, Xindong Zhang, Jixiang Meng:
Local-restricted-edge-connectivity of graphs. Ars Comb. 113: 97-104 (2014) - [j78]Yingzhi Tian, Jixiang Meng:
On super restricted edge-connectivity of vertex-transitive graphs. Ars Comb. 113: 211-223 (2014) - [j77]Yingzhi Tian, Jixiang Meng:
On super connectedness and super restricted edge-connectedness of total graphs. Ars Comb. 114: 309-319 (2014) - [j76]Weihua Yang, Jixiang Meng:
Extraconnectivity of Folded Hypercubes. Ars Comb. 116: 121-127 (2014) - [j75]Xing Chen, Wei Xiong, Jixiang Meng:
Super-λ Connectivity of Bipartite Graphs. Ars Comb. 117: 353-361 (2014) - [j74]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - [j73]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang:
On the existence of super edge-connected graphs with prescribed degrees. Discret. Math. 328: 36-41 (2014) - [j72]Fengxia Liu, Zhao Zhang, Jixiang Meng:
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. Graphs Comb. 30(3): 699-705 (2014) - [j71]Yingzhi Tian, Jixiang Meng:
On restricted edge-connectivity of vertex-transitive multigraphs. Int. J. Comput. Math. 91(8): 1655-1661 (2014) - [j70]Mingzu Zhang, Jixiang Meng, Weihua Yang, Yingzhi Tian:
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity. Inf. Sci. 279: 374-382 (2014) - 2013
- [j69]Xingchao Deng, Jixiang Meng:
The Diameters of Almost All Bi-Cayley Graphs. Ars Comb. 111: 65-74 (2013) - [j68]Xianglan Cao, Litao Guo, Xiaofeng Guo, Jixiang Meng:
Super connectivity and super arc connectivity of the Mycielskian of a digraph. Ars Comb. 111: 453-461 (2013) - 2012
- [j67]Huiqiu Lin, Jixiang Meng, Weihua Yang:
Super restricted edge connectivity of regular graphs with two orbits. Appl. Math. Comput. 218(12): 6656-6660 (2012) - [j66]Weihua Yang, Jixiang Meng:
Generalized measures of fault tolerance in hypercube networks. Appl. Math. Lett. 25(10): 1335-1339 (2012) - [j65]Xiujuan Zhang, Juan Liu, Yan Long, Jixiang Meng:
The Properties of Transformation Digraphs Dxyz. Ars Comb. 103: 353-358 (2012) - [j64]Juan Liu, Jixiang Meng, Xindong Zhang:
The Transformation Digraph D++-. Ars Comb. 104: 525-535 (2012) - [j63]Hua Zou, Jixiang Meng:
Graph Eigenvalues Under a Graph Transformation. Ars Comb. 105: 15-22 (2012) - [j62]Huiping Cai, Juan Liu, Jixiang Meng:
Domination number in iterated line digraph of a complete bipartite digraph. Ars Comb. 107: 515-520 (2012) - [j61]Yanmei Hong, Jixiang Meng, Zhao Zhang:
Edge fault tolerance of graphs with respect to super edge connectivity. Discret. Appl. Math. 160(4-5): 579-587 (2012) - [j60]Yingzhi Tian, Jixiang Meng, Zhao Zhang:
On the connectivity of p-diamond-free vertex transitive graphs. Discret. Appl. Math. 160(7-8): 1285-1290 (2012) - [j59]Hengzhe Li, Weihua Yang, Jixiang Meng:
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. Discret. Math. 312(21): 3087-3095 (2012) - [j58]Yingzhi Tian, Jixiang Meng, Xiaodong Liang:
On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs. Graphs Comb. 28(2): 287-296 (2012) - [j57]Yingzhi Tian, Litao Guo, Jixiang Meng, Chengfu Qin:
Inverse degree and super edge-connectivity. Int. J. Comput. Math. 89(6): 752-759 (2012) - [j56]Xing Chen, Juan Liu, Jixiang Meng:
λ-Optimality of Bipartite Digraphs. Inf. Process. Lett. 112(17-18): 701-705 (2012) - 2011
- [j55]Yingzhi Tian, Jixiang Meng:
λ′-optimally connected mixed Cayley graphs. Appl. Math. Lett. 24(6): 872-877 (2011) - [j54]Juan Liu, Xindong Zhang, Jixiang Meng:
The Properties of Middle Digraphs. Ars Comb. 101: 153-160 (2011) - [j53]Xindong Zhang, Juan Liu, Jixiang Meng:
Domination in lexicographic product graphs. Ars Comb. 101: 251-256 (2011) - [j52]Xing Chen, Juan Liu, Jixiang Meng:
Total restrained domination in graphs. Comput. Math. Appl. 62(8): 2892-2898 (2011) - [j51]Ying Xu, Jixiang Meng:
Gaussian integral circulant digraphs. Discret. Math. 311(1): 45-50 (2011) - [j50]Yingzhi Tian, Jixiang Meng:
Superconnected and Hyperconnected Small Degree Transitive Graphs. Graphs Comb. 27(2): 275-287 (2011) - [j49]Juan Liu, Xindong Zhang, Jixiang Meng:
On domination number of Cartesian product of directed paths. J. Comb. Optim. 22(4): 651-662 (2011) - 2010
- [j48]Weihua Yang, Jixiang Meng:
Extraconnectivity of hypercubes (II). Australas. J Comb. 47: 189-196 (2010) - [j47]Xing Chen, Zhihua Du, Jixiang Meng:
Coloring and the Lovász Local Lemma. Appl. Math. Lett. 23(3): 219-221 (2010) - [j46]Mingyan Fu, Weihua Yang, Jixiang Meng:
Extraconnectivity of Cartesian product graphs of paths. Ars Comb. 96 (2010) - [j45]Juan Liu, Jixiang Meng, Zhao Zhang:
Double-super-connected digraphs. Discret. Appl. Math. 158(9): 1012-1016 (2010) - [j44]Yingzhi Tian, Jixiang Meng:
On super restricted edge-connectivity of edge-transitive graphs. Discret. Math. 310(17-18): 2273-2279 (2010) - [j43]Juan Liu, Xindong Zhang, Xing Chen, Jixiang Meng:
On domination number of Cartesian product of directed cycles. Inf. Process. Lett. 110(5): 171-173 (2010) - [j42]Weihua Yang, Hengzhe Li, Jixiang Meng:
Conditional connectivity of Cayley graphs generated by transposition trees. Inf. Process. Lett. 110(23): 1027-1030 (2010) - [j41]Xindong Zhang, Juan Liu, Xing Chen, Jixiang Meng:
Domination number of Cartesian products of directed cycles. Inf. Process. Lett. 111(1): 36-39 (2010)
2000 – 2009
- 2009
- [j40]Juan Liu, Lin Sun, Jixiang Meng:
A line digraph of a complete bipartite digraph. Appl. Math. Lett. 22(4): 544-547 (2009) - [j39]Weihua Yang, Jixiang Meng:
Extraconnectivity of hypercubes. Appl. Math. Lett. 22(6): 887-891 (2009) - [j38]Weihua Yang, Jixiang Meng:
Embedding connected double-loop networks with even cardinality in books. Appl. Math. Lett. 22(9): 1458-1461 (2009) - [j37]Bao-Xing Chen, Jixiang Meng, Wenjun Xiao:
A diameter formula for an undirected double-loop network. Ars Comb. 90 (2009) - [j36]Ying Xu, Jixiang Meng:
On the Folded hypercube and Bi-folded Hypercube. Ars Comb. 92 (2009) - [j35]Ying Xu, Jixiang Meng:
Some Algebraic Properties of Bi-Circulant Digraphs. Ars Comb. 92 (2009) - [j34]Jixiang Meng, Zhao Zhang:
Super-connected arc-transitive digraphs. Discret. Appl. Math. 157(4): 653-658 (2009) - [j33]Jinyang Chen, Jixiang Meng, Lihong Huang:
Super edge-connectivity of mixed Cayley graph. Discret. Math. 309(1): 264-270 (2009) - [j32]Juan Liu, Xing Chen, Jixiang Meng:
Super restricted edge connected Cartesian product graphs. Inf. Process. Lett. 109(13): 655-659 (2009) - [j31]Yingzhi Tian, Jixiang Meng:
lambdac-Optimally half vertex transitive graphs with regularity k. Inf. Process. Lett. 109(13): 683-686 (2009) - [j30]Xindong Zhang, Juan Liu, Jixiang Meng:
The bondage number in complete t-partite digraphs. Inf. Process. Lett. 109(17): 997-1000 (2009) - [j29]Xing Chen, Juan Liu, Jixiang Meng:
The restricted arc connectivity of Cartesian product digraphs. Inf. Process. Lett. 109(21-22): 1202-1205 (2009) - [j28]Xinlong Feng, Yinnian He, Jixiang Meng:
Application of modified homotopy perturbation method for solving the augmented systems. J. Comput. Appl. Math. 231(1): 288-301 (2009) - 2008
- [j27]Juan Liu, Jixiang Meng:
Super-Arc-Connected and Super-Connected Total Digraphs. Ars Comb. 87 (2008) - [j26]Xiaodong Liang, Jixiang Meng:
Connectivity of bi-Cayley Graphs. Ars Comb. 88 (2008) - [j25]Zhao Zhang, Jixiang Meng:
Super-connected edge transitive graphs. Discret. Appl. Math. 156(10): 1948-1953 (2008) - [j24]Fengxia Liu, Jixiang Meng:
Edge-connectivity of regular graphs with two orbits. Discret. Math. 308(16): 3711-3716 (2008) - [j23]Juan Liu, Jixiang Meng:
Super-connected and super-arc-connected Cartesian product of digraphs. Inf. Process. Lett. 108(3): 90-93 (2008) - [j22]Rui Li, Jixiang Meng:
Reversals Cayley graphs of symmetric groups. Inf. Process. Lett. 109(2): 130-132 (2008) - 2007
- [j21]Xiaodong Liang, Jixiang Meng, Zhao Zhang:
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs. Graphs Comb. 23(3): 309-314 (2007) - [c4]Xiaodong Liang, Jixiang Meng:
Connectivity of Connected Bipartite Graphs with Two Orbits. International Conference on Computational Science (3) 2007: 334-337 - 2006
- [j20]Zhao Zhang, Jixiang Meng:
Restricted Edge Connectivity of Edge Transitive Graphs. Ars Comb. 78 (2006) - [j19]Zhao Zhang, Jixiang Meng:
On optimally-lambda(3) transitive graphs. Discret. Appl. Math. 154(6): 1011-1018 (2006) - [j18]Zhao Zhang, Jixiang Meng:
Semi-hyper-connected edge transitive graphs. Discret. Math. 306(7): 705-710 (2006) - [j17]Bao-Xing Chen, Jixiang Meng, Wenjun Xiao:
Some new optimal and suboptimal infinite families of undirected double-loop networks. Discret. Math. Theor. Comput. Sci. 8(1): 299-312 (2006) - 2005
- [c3]Bao-Xing Chen, Jixiang Meng, Wenjun Xiao:
A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks. MSN 2005: 308-316 - 2004
- [j16]Baoyindureng Wu, Jixiang Meng:
Hamiltonian jump graphs. Discret. Math. 289(1-3): 95-106 (2004) - 2003
- [j15]Jixiang Meng:
Connectivity of Vertex and Edge Transitive Graphs. Discret. Appl. Math. 127(3): 601-613 (2003) - [j14]Jixiang Meng:
Optimally super-edge-connected transitive graphs. Discret. Math. 260(1-3): 239-248 (2003) - [j13]Jixiang Meng, Zhao Zhang:
Number of minimum vertex cuts in transitive graphs. Discret. Math. 270(1-3): 310-316 (2003) - 2002
- [j12]Jixiang Meng, Youhu Ji:
On a kind of restricted edge connectivity of graphs. Discret. Appl. Math. 117(1-3): 183-193 (2002) - 2000
- [j11]Jixiang Meng, Jianzhong Wang:
A classification of 2-arc-transitive circulant digraphs. Discret. Math. 222(1-3): 281-284 (2000) - [j10]Jixiang Meng, Bao Ying:
Normal Minimal Cayley Digraphs of Abelian Groups. Eur. J. Comb. 21(4): 523-528 (2000) - [j9]Qiongxiang Huang, Jixiang Meng:
A Classification of DCI(CI)-Subsets for Cyclic Group of Odd Prime Power Order. J. Comb. Theory B 78(1): 24-34 (2000)
1990 – 1999
- 1998
- [j8]Jixiang Meng, Qiongxiang Huang:
Almost all Cayley graphs have diameter 2. Discret. Math. 178(1-3): 267-269 (1998) - [j7]Jixiang Meng, Mingyao Xu:
On the isomorphism problem of Cayley graphs of Abelian groups. Discret. Math. 187(1-3): 161-169 (1998) - 1997
- [j6]Jian-Zhong Wang, Jixiang Meng:
The Exponent of the Primitive Cayley Digraphs on Finite Abelian Groups. Discret. Appl. Math. 80(2-3): 177-191 (1997) - [j5]Jixiang Meng, Qiongxiang Huang:
The Automorphism Groups of Minimal Infinite Circulant Digraphs. Eur. J. Comb. 18(4): 425-429 (1997) - 1996
- [j4]Mingyao Xu, Jixiang Meng:
Weakly 3-DCI abelian groups. Australas. J Comb. 13: 49-60 (1996) - [j3]Qiongxiang Huang, Jixiang Meng:
On the isomorphisms and automorphism groups of circulants. Graphs Comb. 12(1): 179-187 (1996) - [c2]Jixiang Meng:
Superconnectivity for Minimal Multi-loop Networks. COCOON 1996: 417-419 - 1995
- [j2]Jixiang Meng, Mingyao Xu:
Automorphisms of groups and isomorphisms of Cayley digraphs. Australas. J Comb. 12: 93-100 (1995) - [j1]Jixiang Meng:
The generalized S-graphs of diameter 3. Discret. Math. 140(1-3): 95-106 (1995) - [c1]Jixiang Meng:
Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups. COCOON 1995: 384-387
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
