Results 21 to 30 of about 10,577,886 (268)
The Existence of Path-Factor Covered Graphs
Discussiones Mathematicae Graph Theory, 2023 A spanning subgraph H of a graph G is called a P≥k-factor of G if every component of H is isomorphic to a path of order at least k, where k ≥ 2. A graph G is called a P≥k-factor covered graph if there is a P≥k-factor of G covering e for any e ∈ E(G).
Dai Guowei
doaj +1 more source
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover [PDF]
, 2002 Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier.
Dinur, Irit +3 more
core +4 more sources
Comparison of the K factor in different areas on the slope
Journal of New Results in Science, 2021 Erosion is among the leading factors threatening our sources of soil and water. The use of soil susceptibility indices to determine erosion and risk situations is vital, especially in erosion studies.
Yunus Akdoğan +3 more
doaj
Precision measurements of rare kaon decays [PDF]
, 2009 We report the recent results on rare kaon decays from the NA48/2 experiment. The precise measurement of direct photon emission (DE) in the decay K+- -> pi+- pi0 gamma and its interference (INT), with the INT amplitude being observed for the first time ...
Marinova, Evelina
core +2 more sources
Factorizations of $k$-nonnegative matrices
Journal of Combinatorics, 2022 A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k = n-1$ and when $k = n-2$, restricted to unitriangular matrices.
Chepuri, Sunita +3 more
openaire +2 more sources
Some Combinatorial Results on the Factor Group K (G)
Journal of Kufa for Mathematics and Computer, 2016 character matrix ( ) from the character table of and finding the invariant factors of this matrix, the primary decomposition of the factor group where is determined.
Manal Najy Yagoob, Ahmed Abed Ali Omran
doaj +1 more source
Evolutionary Psychology, 2020 Life history theory is useful for taking an evolutionary approach to individual differences. An individual’s life history strategy (LHS), based on life history theory, can be measured using the Arizona Life History Battery or a part of it—the Mini-K—as ...
Satoru Kiire
doaj +1 more source
Near-Optimal UGC-hardness of Approximating Max k-CSP_R [PDF]
, 2015 In this paper, we prove an almost-optimal hardness for Max $k$-CSP$_R$ based on Khot's Unique Games Conjecture (UGC). In Max $k$-CSP$_R$, we are given a set of predicates each of which depends on exactly $k$ variables.
Manurangsi, Pasin +2 more
core +2 more sources
A Spatially Consistent MIMO Channel Model With Adjustable K Factor
IEEE Access, 2019 In the area of research on massive multiple-input multiple-output (MIMO), two assumptions on the wireless channel dominate channel modeling. Either, a rich scattering environment is assumed and the channel is modeled as i.i.d. Rayleigh fading, or, a line
Stefan Pratschner +6 more
doaj +1 more source
On unique k-factors and unique [1,k]-factors in graphs
Discrete Mathematics, 2004 Let \(G\) be a graph and let \(a\) and \(b\), \(a\leq b\), be two positive integers. A spanning subgraph \(F\) of \(G\) is an \([a,b]\)-factor if \(a\leq \deg_Fv\leq b\), for every vertex \(v\) in \(G\). A \([k,k]\)-factor is called a \(k\)-factor. An \([a,b]\)-factor is perfect if each of its components is a regular graph.
Hoffmann, Arne, Volkmann, Lutz
openaire +2 more sources