Results 11 to 20 of about 2,490 (239)
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Eddie +2 more
openaire +2 more sources
Fractional matching preclusion number of graphs [PDF]
Discrete Applied Mathematics, 2022 The \emph{fractional matching preclusion number} of a graph $G$, denoted by $fmp(G)$, is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings. In this paper, we first give some sharp upper and lower bounds of fractional matching preclusion number.
Jinyu Zou +3 more
openaire +3 more sources
The Matching Preclusion of Enhanced Hypercubes
The Computer Journal, 2021 Abstract The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. The (conditional) strong matching preclusion number of a graph is the minimum number of vertices and edges ...
Shiying Wang, Xiaolei Ma
openaire +1 more source
Computational procedures for stochastic multi-echelon production systems [PDF]
, 1991 This paper is concerned with the numerical evaluation of multi-echelon production systems. Each stage requires a fixed predetermined leadtime; furthermore, we assume a stochastic, stationary end-time demand process. In a previous paper, we have developed
Houtum, G.J.J.A. van, Zijm, W.H.M.
core +2 more sources
Matching preclusion and strong matching preclusion of the bubble-sort star graphs
, 2020 Since a plurality of processors in a distributed computer system working in parallel, to ensure the fault tolerance and stability of the network is an important issue in distributed systems. As the topology of the distributed network can be modeled as a graph, the (strong) matching preclusion in graph theory can be used as a robustness measure for ...
Wang, Xin, Ma, Chaoqun, Guo, Jia
openaire +2 more sources
Combinatorial approaches to Hopf bifurcations in systems of interacting elements [PDF]
, 2013 We describe combinatorial approaches to the question of whether families of real matrices admit pairs of nonreal eigenvalues passing through the imaginary axis.
Angeli, David +2 more
core +3 more sources
Technology, privacy and identity: a Hong Kong perspective [PDF]
, 2008 This article explores the concepts of privacy and identity in Hong Kong in relation to the law relating to data protection. It first considers the notions of privacy and identity in the light of Hong Kong's socioeconomic situation and recent postcolonial
Wong, R, Yap, JL
core +1 more source
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Eddie, Lipták, László
openaire +2 more sources
Super edge-connectivity and matching preclusion of data center networks
, 2019 Edge-connectivity is a classic measure for reliability of a network in the presence of edge failures. $k$-restricted edge-connectivity is one of the refined indicators for fault tolerance of large networks.
Lü, Huazhong, Wu, Tingzeng
core +1 more source
Matching preclusion for balanced hypercubes
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lü, Huazhong +2 more
openaire +1 more source