Uniform binary geometries.
Uniform distrubution, positive trigonometric polynomials and difference sets
Uniform edge distribution in hypergraphs is hereditary.
Uniform mixing time for random walk on lamplighter graphs
Suppose that is a finite, connected graph and is a lazy random walk on . The lamplighter chain associated with is the random walk on the wreath product , the graph whose vertices consist of pairs where is a labeling of the vertices of by elements of and is a vertex in . There is an edge between and in if and only if is adjacent to in and for all . In each step, moves from a configuration by updating to using the transition rule of and then sampling both...
Uniform Oriented Matroids Without the Isotopy Property.
Uniformität des Verbandes der Partitionen
Unimodality of certain sequences connected with binomial coefficients.
Unimodality problems of multinomial coefficients and symmetric functions.
Union of all the minimum cycle bases of a graph.
Union of Distance Magic Graphs
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.
Uniongraph der Familie von Zerlegungen in einer Menge
Unique difference bases of .
Unique factorisation of additive induced-hereditary properties
An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ₁,...,ₙ be additive hereditary graph properties. A graph G has property (₁∘...∘ₙ) if there is a partition (V₁,...,Vₙ) of V(G) into n sets such that, for all i, the induced subgraph is in . A property is reducible if there are properties , such that = ∘ ; otherwise it is irreducible. Mihók, Semanišin and Vasky [8] gave a factorisation for any additive hereditary...
Unique Factorization of Arithmetic Functions
Unique factorization theorem
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let ₁,₂, ...,ₙ be properties of graphs. A graph G is (₁,₂,...,ₙ)-partitionable (G has property ₁ º₂ º... ºₙ) if the vertex set V(G) of G can be partitioned into n sets V₁,V₂,..., Vₙ such that the subgraph of G induced by Vi belongs to ; i = 1,2,...,n. A property is said to be reducible...
Unique factorization theorem for object-systems
The concept of an object-system is a common generalization of simple graph, digraph and hypergraph. In the theory of generalised colourings of graphs, the Unique Factorization Theorem (UFT) for additive induced-hereditary properties of graphs provides an analogy of the well-known Fundamental Theorem of Arithmetics. The purpose of this paper is to present UFT for object-systems. This result generalises known UFT for additive induced-hereditary and hereditary properties of graphs and digraphs. Formal...
Uniquely edge colourable graphs
Uniquely edge extendible graphs
Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs.
Uniquely -colorable and chromatically equivalent graphs.