Results 1 to 10 of about 3,064 (108)
Edge Fault-Tolerant Strong Menger Edge Connectivity of Folded Crossed Cubes
AxiomsA graph is called strongly Menger-edge connected (SME-connected) if any two vertices are connected by as many edge-disjoint paths as their smaller degree.
Huanshen Jia, Jianguo Qian
doaj +3 more sources
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort graphs
AIMS Mathematics, 2021 <abstract><p>This paper studies the edge-fault-tolerant strong Menger edge connectivity of $ n $-dimensional bubble-sort graph $ B_{n} $. We give the values of faulty edges that $ B_{n} $ can tolerant when $ B_{n} $ is strongly Menger edge connected under two conditions. When there are $ (n-3) $ faulty edges removed from $ B_{n} $, the $ B_{
Yanling Wang, Shiying Wang
openaire +4 more sources
On Conditional Edge-Fault-Tolerant Strong Menger Edge Connectivity Of Folded Hypercubes
The Computer Journal, 2023 Abstract Edge connectivity is an important parameter for the reliability of the inter-connection network. A graph $G$ is strong Menger edge-connected ($SM$-$\lambda $ for short) if there exist min$\{\deg _{G}(u),\deg _{G}(v)\}$ edge-disjoint paths between any pair of vertices $u$ and $v$ of $G$.
Shijie Zhao, Pingshan Li
openaire +2 more sources
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs [PDF]
Discrete Applied Mathematics, 2019 19 pages, 3 ...
Jia Guo, Mei Lu
openaire +3 more sources
Theoretical Computer Science, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pingshan Li, Min Xu
openaire +2 more sources
Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pingshan Li, Min Xu
openaire +3 more sources
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs [PDF]
Discrete Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia Guo, Mei Lu
openaire +1 more source
The Menger number of the strong product of graphs [PDF]
, 2013 The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected graph G, denoted by ζℓ(x, y), is the maximum number of internally disjoint xy-paths whose lengths are at most ℓ in G. The Menger number of G with respect
Abajo Casado, María Encarnación +3 more
core +1 more source
Strong Menger connectedness of augmented k-ary n-cubes [PDF]
Computer/law journal, 2019 A connected graph $G$ is called strongly Menger (edge) connected if for any two distinct vertices $x,y$ of $G$, there are $\min \{\textrm{deg}_G(x), \textrm{deg}_G(y)\}$ internally disjoint (edge disjoint) paths between $x$ and $y$.
Mei-Mei Gu, Jou-Ming Chang, Rongxia Hao
semanticscholar +1 more source
Connectivity calculus of fractal polyhedrons [PDF]
, 2015 The paper analyzes the connectivity information (more precisely, numbers of tunnels and their homological (co)cycle classification) of fractal polyhedra.
Klette, Reinhard +3 more
core +1 more source