Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations

2020 ◽  
Vol 280 ◽  
pp. 53-62
Author(s):  
Manoj Changat ◽  
Ferdoos Hossein Nezhad ◽  
N. Narayanan
Keyword(s):  
Interval Function ◽  
Axiomatic Characterizations ◽  
Induced Path

scholarly journals Axiomatic characterizations under players nullification

2016 ◽  
Vol 80 ◽  
pp. 47-57 ◽  
Author(s):  
Sylvain Béal ◽  
Sylvain Ferrières ◽  
Eric Rémila ◽  
Philippe Solal
Keyword(s):  
Axiomatic Characterizations

Effects of Players’ Nullification and Equal (Surplus) Division Values

2018 ◽  
Vol 20 (01) ◽  
pp. 1750029 ◽  
Author(s):  
Takumi Kongo
Keyword(s):  
The Other ◽  
Equal Division ◽  
Transferable Utility ◽  
Tu Games ◽  
Axiomatic Characterizations ◽  
The Difference ◽  
Monotonicity Axioms ◽  
Equal Surplus Division

We provide axiomatic characterizations of the solutions of transferable utility (TU) games on the fixed player set, where at least three players exist. We introduce two axioms on players’ nullification. One axiom requires that the difference between the effect of a player’s nullification on the nullified player and on the others is relatively constant if all but one players are null players. Another axiom requires that a player’s nullification affects equally all of the other players. These two axioms characterize the set of all affine combinations of the equal surplus division and equal division values, together with the two basic axioms of efficiency and null game. By replacing the first axiom on players’ nullification with appropriate monotonicity axioms, we narrow down the solutions to the set of all convex combinations of the two values, or to each of the two values.

scholarly journals Axiomatic characterization of the interval function of a graph

2009 ◽  
Vol 30 (5) ◽  
pp. 1172-1185 ◽  
Author(s):  
Henry Martyn Mulder ◽  
Ladislav Nebeský
Keyword(s):  
Axiomatic Characterization ◽  
Interval Function

Edge lifting and Roman domination in graphs

2020 ◽  
pp. 2150064
Author(s):  
Hicham Meraimi ◽  
Mustapha Chellali
Keyword(s):  
Domination Number ◽  
Roman Domination ◽  
Roman Domination Number ◽  
Induced Path ◽  
Domination In Graphs

Let [Formula: see text] be a graph, and let [Formula: see text] be an induced path centered at [Formula: see text]. An edge lift defined on [Formula: see text] is the action of removing edges [Formula: see text] and [Formula: see text] while adding the edge [Formula: see text] to the edge set of [Formula: see text]. In this paper, we initiate the study of the effects of edge lifting on the Roman domination number of a graph, where various properties are established. A characterization of all trees for which every edge lift increases the Roman domination number is provided. Moreover, we characterize the edge lift of a graph decreasing the Roman domination number, and we show that there are no graphs with at most one cycle for which every possible edge lift can have this property.

Mechanically Induced Path Deviations in an Industrial Parallelogram Robot

1990 ◽  
Author(s):  
Pierre-J. de Smet ◽  
Eugene I. Rivin ◽  
Youngle Lou
Keyword(s):  
Induced Path

OUTCOME LEVEL ANALYSIS OF BELIEF CONTRACTION

2013 ◽  
Vol 6 (2) ◽  
pp. 183-204 ◽  
Author(s):  
SVEN OVE HANSSON
Keyword(s):  
Belief Change ◽  
Belief Contraction ◽  
Axiomatic Characterizations ◽  
Outcome Set ◽  
Level Analysis

AbstractThe outcome set of a belief change operator is the set of outcomes that can be obtained with it. Axiomatic characterizations are reported for the outcome sets of the standard AGM contraction operators and eight types of base-generated contraction. These results throw new light on the properties of some of these operators.

Sign in / Sign up

Export Citation Format

Share Document