Results 11 to 20 of about 915 (94)
A Bell Inequality Analog in Quantum Measure Theory [PDF]
, 2006 One obtains Bell's inequalities if one posits a hypothetical joint probability distribution, or {\it measure}, whose marginals yield the probabilities produced by the spin measurements in question.
+21 more
core +5 more sources
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
Inequality, Fairness and Social Capital [PDF]
, 2018 We study the impact of unjust inequality on social trust and trustworthiness, and its separate effect on the economically successful and the unsuccessful, in a controlled economic experiment.
Fehr, Dietmar +3 more
core +3 more sources
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
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Eddie +3 more
openaire +1 more source
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Park, Jung-Heum, Son, Sang Hyuk
openaire +1 more source
Matching Preclusion and Conditional Matching Preclusion Problems for Twisted Cubes [PDF]
, 2010 The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced
Bhaskar, Ram +4 more
core
A complete classification of which $(n,k)$-star graphs are Cayley graphs
, 2017 The $(n,k)$-star graphs are an important class of interconnection networks that generalize star graphs, which are superior to hypercubes. In this paper, we continue the work begun by Cheng et al.~(Graphs and Combinatorics 2017) and complete the ...
Cheng, Eddie +4 more
core +1 more source
Strong matching preclusion under the conditional fault model
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Park, Jung-Heum, Ihm, Insung
openaire +2 more sources