Results 31 to 40 of about 149,581 (278)
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits [PDF]
, 2013 We give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth two which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}.
Impagliazzo, Russell +2 more
core +1 more source
Complexity of Roman {2}-domination and the double Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham +1 more
doaj +1 more source
DOMINATION, FIBRATIONS, AND SPLITTING
The Journal of Symbolic LogicAbstract This article is concerned with finite rank stability theory, and more precisely two classical ways to decompose a type using minimal types. The first is its domination equivalence to a Morley product of minimal types, and the second is its semi-minimal analysis, both of which are useful in applications.
CHRISTINE EAGLES, LÉO JIMENEZ
openaire +2 more sources
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Keranen, Melissa, Lauri, Juho
core +3 more sources
DOMINATED SPLITTING WITH STABLY EXPANSIVE [PDF]
The Pure and Applied Mathematics, 2011 In this paper, we show that if a transitive set is -stably expansive, then admits a dominated splitting.
openaire +1 more source
On fully split lacunary polynomials in finite fields [PDF]
, 2011 We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph ...
Bibak, Khodakhast, Shparlinski, Igor E.
core +1 more source
Divisor equitably strong non-split divisor equitable domination in graphs
Mathematics in Applied Sciences and EngineeringIn epidemiology, the spread of diseases can be modelled using graphs, where individuals are nodes, and edges represent potential pathways for disease transmission.
Priyanka G. B. +2 more
doaj +1 more source
NP-completeness of weakly convex and convex dominating set decision problems [PDF]
Opuscula Mathematica, 2004 The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \(NP\)-complete for bipartite and split graphs.
Joanna Raczek
doaj
Archives of Mechanics, 2021 In this study, novel composite strips based on 2017A-T4 aluminium alloy (Al-Cu-Mg) produced by accumulative roll bonding (ARB) were developed. The microstructure and mechanical properties of the ultrafine-grained sheets under quasistatic and dynamic ...
A. Halimi +7 more
doaj +1 more source
Vector bundles on the projective line and finite domination of chain complexes [PDF]
, 2014 Finitely dominated chain complexes over a Laurent polynomial ring in one indeterminate are characterised by vanishing of their Novikov homology. We present an algebro-geometric approach to this result, based on extension of chain complexes to sheaves on ...
Huettemann, Thomas
core +2 more sources