Results 101 to 110 of about 3,103 (144)
Some of the next articles are maybe not open access.
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs
International Journal of Foundations of Computer Science, 2022With the rapid development and advances of very large scale integration technology and wafer-scale integration technology, multiprocessor systems, taking interconnection networks as underlying topologies, have been widely designed and used in big data era. The topology of an interconnection network is usually represented as a graph.
Zhengqin Yu, Shuming Zhou, Hong Zhang
openaire +3 more sources
Edge-fault-tolerant strong Menger edge connectivity on regular graphs
Theoretical Computer Science, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Min, Li, Pingshan
openaire +3 more sources
Fault-tolerant strong Menger (edge) connectivity of arrangement graph
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pingshan Li, Min Xu
openaire +2 more sources
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
Theoretical Computer Science, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi Cheng, Pingshan Li, Min Xu
semanticscholar +4 more sources
The edge fault-tolerance about the strong Menger edge-connectivity of order
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingzu Zhang +3 more
openaire +3 more sources
Edge-Fault-Tolerant Strong Menger Edge Connectivity of Wheel Networks
Advances in Applied Mathematics, 2023俐贞 南
openaire +2 more sources
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube
International Journal of Foundations of Computer Science, 2022Menger-type problems in interconnection networks have received many attentions in recent years. A connected graph [Formula: see text] is strong Menger (edge) connected if there are [Formula: see text] vertex (edge)-disjoint paths joining any two distinct
Meijie Ma, Chaoming Guo, Xiang-Jun Li
semanticscholar +1 more source
The Strong Menger Connectivity of the Directed k-Ary n-Cube
J. Interconnect. Networks, 2023A strong digraph [Formula: see text] is strongly Menger (arc) connected if, for [Formula: see text], [Formula: see text] can reach [Formula: see text] by min[Formula: see text] internally (arc) disjoint-directed paths.
Guoqiang Xie, J. Meng
semanticscholar +1 more source
Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
International Journal of Foundations of Computer Science, 2021Large scale multiprocessor systems or multicomputer systems, taking interconnection networks as underlying topologies, have been widely used in the big data era.
Yihong Wang +3 more
semanticscholar +1 more source
On the Edge Connectivity of Semi-strong Product Graphs
Applied and Computational MathematicsThe concept of edge connectivity was first proposed by K. Menger, and in communication networks and logical networks, edge connectivity can be used to measure network reliability and fault tolerance.
Qiaoling Wang, Haizhen Ren
semanticscholar +1 more source