Displaying 581 – 600 of 724

Showing per page

An Implicit Weighted Degree Condition For Heavy Cycles

Junqing Cai, Hao Li, Wantao Ning (2014)

Discussiones Mathematicae Graph Theory

For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains...

An inequality chain of domination parameters for trees

E.J. Cockayne, O. Favaron, J. Puech, C.M. Mynhardt (1998)

Discussiones Mathematicae Graph Theory

We prove that the smallest cardinality of a maximal packing in any tree is at most the cardinality of an R-annihilated set. As a corollary to this result we point out that a set of parameters of trees involving packing, perfect neighbourhood, R-annihilated, irredundant and dominating sets is totally ordered. The class of trees for which all these parameters are equal is described and we give an example of a tree in which most of them are distinct.

An inequality concerning edges of minor weight in convex 3-polytopes

Igor Fabrici, Stanislav Jendrol' (1996)

Discussiones Mathematicae Graph Theory

Let e i j be the number of edges in a convex 3-polytope joining the vertices of degree i with the vertices of degree j. We prove that for every convex 3-polytope there is 20 e 3 , 3 + 25 e 3 , 4 + 16 e 3 , 5 + 10 e 3 , 6 + 6 [ 2 / 3 ] e 3 , 7 + 5 e 3 , 8 + 2 [ 1 / 2 ] e 3 , 9 + 2 e 3 , 10 + 16 [ 2 / 3 ] e 4 , 4 + 11 e 4 , 5 + 5 e 4 , 6 + 1 [ 2 / 3 ] e 4 , 7 + 5 [ 1 / 3 ] e 5 , 5 + 2 e 5 , 6 120 ; moreover, each coefficient is the best possible. This result brings a final answer to the conjecture raised by B. Grünbaum in 1973.

An optimal matching problem

Ivar Ekeland (2005)

ESAIM: Control, Optimisation and Calculus of Variations

Given two measured spaces ( X , μ ) and ( Y , ν ) , and a third space Z , given two functions u ( x , z ) and v ( x , z ) , we study the problem of finding two maps s : X Z and t : Y Z such that the images s ( μ ) and t ( ν ) coincide, and the integral X u ( x , s ( x ) ) d μ - Y v ( y , t ( y ) ) d ν is maximal. We give condition on u and v for which there is a unique solution.

An optimal matching problem

Ivar Ekeland (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Given two measured spaces ( X , μ ) and ( Y , ν ) , and a third space Z, given two functions u(x,z) and v(x,z), we study the problem of finding two maps s : X Z and t : Y Z such that the images s ( μ ) and t ( ν ) coincide, and the integral X u ( x , s ( x ) ) d μ - Y v ( y , t ( y ) ) d ν is maximal. We give condition on u and v for which there is a unique solution.

Currently displaying 581 – 600 of 724