Results 21 to 30 of about 915 (94)
The (conditional) matching preclusion for burnt pancake graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Xiaolan, Liu, Huiqing
openaire +2 more sources
A hand up or a slap down? Criminalising benefit claimants in Britain via strategies of surveillance, sanctions and deterrence [PDF]
, 2017 British policy makers have increasingly sought to intensify and extend welfare conditionality. A distinctly more punitive turn was taken in 2012 to re-orientate the whole social security and employment services system to combine harsh sanctions with ...
Fletcher, Del, Wright, Sharon
core +1 more source
Generalized Matching Preclusion in Bipartite Graphs [PDF]
, 2018 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Cheng, Eddie +4 more
core +1 more source
Preclusion for Radix Triangular Mesh [PDF]
, 2013 In this paper we find the values of mp(T n ) and mp 1 (T n ) when n(n+1)≡0 (mod 4). Every minimum matching preclusion set in an n-triangular mesh network is trivial. Also, mp(G) ≤ δ(G), where δ(G) is the minimum degree of G and mp 1 (G) ≤ v e (G)
C. J. Deeni, D. A. Xavier
core +2 more sources
Cyclic decomposition of k-permutations and eigenvalues of the arrangement graphs [PDF]
, 2013 The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions.
Chen, Bai Fan +2 more
core
Electoral cycles in savings bank lending [PDF]
, 2013 We provide causal evidence that German savings banks – where local politicians are by law involved in their management – systematically adjust lending policies in response to local electoral cycles.
Englmaier, Florian, Stowasser, Till
core +6 more sources
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruizhi Lin, Heping Zhang
openaire +2 more sources
Application of aboutness to functional benchmarking in information retrieval [PDF]
, 2001 Experimental approaches are widely employed to benchmark the performance of an information retrieval (IR) system. Measurements in terms of recall and precision are computed as performance indicators.
Bruza, Peter +3 more
core +2 more sources
Capacity of Cellular Wireless Network
, 2017 Earlier definitions of capacity for wireless networks, e.g., transport or transmission capacity, for which exact theoretical results are known, are well suited for ad hoc networks but are not directly applicable for cellular wireless networks, where ...
Iyer, Srikanth, Vaze, Rahul
core +1 more source
Fractional matching preclusion for butterfly derived networks [PDF]
, 2019 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.
Ma, Tianlong +4 more
core +1 more source