相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。The generalized 4-connectivity of hierarchical cubic networks
Shu-Li Zhao et al.
DISCRETE APPLIED MATHEMATICS (2021)
Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity
Qifan Zhang et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2021)
The reliability analysis based on the generalized connectivity in balanced hypercubes
Chao Wei et al.
DISCRETE APPLIED MATHEMATICS (2021)
Constructing Completely Independent Spanning Trees in Data Center Network Based on Augmented Cube
Guo Chen et al.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2021)
An improved algorithm to construct edge-independent spanning trees in augmented cubes
Baolei Cheng et al.
DISCRETE APPLIED MATHEMATICS (2020)
Decomposition of augmented cubes into regular connected pancyclic subgraphs
S. A. Kandekar et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2020)
The κk-connectivity of line graphs
Hengzhe Li et al.
DISCRETE APPLIED MATHEMATICS (2020)
The 4-set tree connectivity of (n, k)-star networks
Chunfang Li et al.
THEORETICAL COMPUTER SCIENCE (2020)
Constructing Node-Independent Spanning Trees in Augmented Cubes
Baolei Cheng et al.
FUNDAMENTA INFORMATICAE (2020)
The Generalized Three-Connectivity of Two Kinds of Cayley Graphs
Shu-Li Zhao et al.
COMPUTER JOURNAL (2019)
The generalized connectivity of the line graph and the total graph for the complete bipartite graph
Yinkui Li et al.
APPLIED MATHEMATICS AND COMPUTATION (2019)
The generalized 4-connectivity of exchanged hypercubes
Shu-Li Zhao et al.
APPLIED MATHEMATICS AND COMPUTATION (2019)
The Generalized Connectivity of Bubble-Sort Star Graphs
Shu-Li Zhao et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2019)
The generalized 3-connectivity of some Regular Networks
Shu-Li Zhao et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2019)
Two kinds of generalized connectivity of dual cubes
Shu-Li Zhao et al.
DISCRETE APPLIED MATHEMATICS (2019)
Fault-Tolerant Panconnectivity of Augmented Cubes AQn
Xirong Xu et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2019)
How many triangles and quadrilaterals are there in an n-dimensional augmented cube?
Qiang Dong et al.
THEORETICAL COMPUTER SCIENCE (2019)
Steiner tree packing number and tree connectivity
Hengzhe Li et al.
DISCRETE MATHEMATICS (2018)
The optimal routing of augmented cubes
Meirun Chen et al.
INFORMATION PROCESSING LETTERS (2018)
ON TWO GENERALIZED CONNECTIVITIES OF GRAPHS
Yuefang Sun et al.
DISCUSSIONES MATHEMATICAE GRAPH THEORY (2018)
The λ3-connectivity and κ3-connectivity of recursive circulants
Hengzhe Li et al.
APPLIED MATHEMATICS AND COMPUTATION (2018)
Constructing spanning trees in augmented cubes
S. A. Mane et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2018)
The generalized connectivity of alternating group graphs and (n, k)-star graphs
Shu-Li Zhao et al.
DISCRETE APPLIED MATHEMATICS (2018)
On the difference of two generalized connectivities of a graph
Yuefang Sun et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)
A solution to a conjecture on the generalized connectivity of graphs
Lily Chen et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles
Shasha Li et al.
GRAPHS AND COMBINATORICS (2017)
Edge-independent spanning trees in augmented cubes
Yan Wang et al.
THEORETICAL COMPUTER SCIENCE (2017)
The generalized 4-connectivity of hypercubes
Shangwei Lin et al.
DISCRETE APPLIED MATHEMATICS (2017)
The generalized 3-connectivity of star graphs and bubble-sort graphs
Shasha Li et al.
APPLIED MATHEMATICS AND COMPUTATION (2016)
An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem
Chia-Wei Lee et al.
IEEE TRANSACTIONS ON COMPUTERS (2015)
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
Chia-Chen Wei et al.
JOURNAL OF DISCRETE ALGORITHMS (2015)
The internal Steiner tree problem: Hardness and approximations
Chao-Wen Huang et al.
JOURNAL OF COMPLEXITY (2013)
Conditional edge-fault pancyclicity of augmented cubes
Dongqin Cheng et al.
THEORETICAL COMPUTER SCIENCE (2013)
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
A. Aazami et al.
ALGORITHMICA (2012)
Note on the hardness of generalized connectivity
Shasha Li et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2012)
Sharp bounds for the generalized connectivity κ3(G)
Shasha Li et al.
DISCRETE MATHEMATICS (2010)
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
Hung-Chang Chan et al.
APPLIED MATHEMATICS AND COMPUTATION (2009)
Packing Element-Disjoint Steiner Trees
Joseph Cheriyan et al.
ACM TRANSACTIONS ON ALGORITHMS (2007)
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Meijie Ma et al.
PARALLEL COMPUTING (2007)