Results 11 to 20 of about 22,452 (283)
Fractional matching preclusion for butterfly derived networks
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.
Xia Wang +4 more
doaj +1 more source
Fractional strong matching preclusion for two variants of hypercubes
Let F be a subset of edges and vertices of a graph G. If G-F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G.
Huifen Ge +3 more
doaj +1 more source
The U.N. Convention on the Recognition and Enforcement of Foreign Arbitral Awards and Issue Preclusion: A Traditional Collateral Estoppel Determination [PDF]
Although the United Nations Convention on the Recognition and Enforcement of Foreign Arbitral Awards provides for the “recognition” and “enforcement” of non-domestic arbitral awards in commercial disputes,1 this article will show that in order for an ...
Sudol, Sabrina M.
core +3 more sources
COMPARATIVE REFLECTIONS ON THE VINDICATION OF RIGHTS IN BRAZIL
The present work examines the contrast between the vindication of rights in Brazil and the other countries in the Americas, especially with regard to the writ of security and analogous devices. It scrutinizes the historical development, along with points
Ángel R. Oquendo
doaj +1 more source
Conditional Strong Matching Preclusion of the Alternating Group Graph
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source
Second Circuit 1999-2000 Res Judicata Developments [PDF]
During the 1999-2000 survey year the United States Court of Appeals for the Second Circuit has issued at least twenty-five res judicata decisions expanding the doctrines of claim preclusion and issue preclusion.
Carlisle, Jay C.
core +2 more sources
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions [PDF]
AbstractThe 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 by a single vertex.
Cheng, Eddie +3 more
openaire +3 more sources
This paper proposes a scientific criticism of “Redefining claim preclusion from verdict sovereignty", in which the immediate execution of the sentence to those convicted by the jury trials is defended. From the delimitation of the concept of democracy in
Antonio Pedro Melchior
doaj +1 more source
Matching Preclusion of the Generalized Petersen Graph
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 with no perfect matchings.
Ajay Arora +2 more
doaj +1 more source
Dynamics & Predictions in the Co-Event Interpretation [PDF]
Sorkin has introduced a new, observer independent, interpretation of quantum mechanics that can give a successful realist account of the 'quantum microworld' as well as explaining how classicality emerges at the level of observable events for a range of ...
Anand P +33 more
core +3 more sources

