All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 28 Next

Displaying 541 – 560 of 585

Showing per page

Vizing's conjecture and the one-half argument

Bert Hartnell, Douglas F. Rall (1995)

Discussiones Mathematicae Graph Theory

The domination number of a graph G is the smallest order, γ(G), of a dominating set for G. A conjecture of V. G. Vizing [5] states that for every pair of graphs G and H, γ(G☐H) ≥ γ(G)γ(H), where G☐H denotes the Cartesian product of G and H. We show that if the vertex set of G can be partitioned in a certain way then the above inequality holds for every graph H. The class of graphs G which have this type of partitioning includes those whose 2-packing number is no smaller than γ(G)-1 as well as the...

Weak selections and flows in networks

Valentin Gutev, Tsugunori Nogura (2008)

Commentationes Mathematicae Universitatis Carolinae

We demonstrate that every Vietoris continuous selection for the hyperspace of at most 3-point subsets implies the existence of a continuous selection for the hyperspace of at most 4-point subsets. However, in general, we do not know if such ``extensions'' are possible for hyperspaces of sets of other cardinalities. In particular, we do not know if the hyperspace of at most 3-point subsets has a continuous selection provided the hyperspace of at most 2-point subsets has a continuous selection.

Zero-divisors of content algebras

Peyman Nasehpour (2010)

Archivum Mathematicum

In this article, we prove that in content extentions minimal primes extend to minimal primes and discuss zero-divisors of a content algebra over a ring who has Property (A) or whose set of zero-divisors is a finite union of prime ideals. We also examine the preservation of diameter of zero-divisor graph under content extensions.

Currently displaying 541 – 560 of 585