Displaying similar documents to “On Orthogonally Additive Functions With Big Graphs”

Further results on sequentially additive graphs

Suresh Manjanath Hegde, Mirka Miller (2007)

Discussiones Mathematicae Graph Theory

Similarity:

Given a graph G with p vertices, q edges and a positive integer k, a k-sequentially additive labeling of G is an assignment of distinct numbers k,k+1,k+2,...,k+p+q-1 to the p+q elements of G so that every edge uv of G receives the sum of the numbers assigned to the vertices u and v. A graph which admits such an assignment to its elements is called a k-sequentially additive graph. In this paper, we give an upper bound for k with respect to which the given graph may possibly be k-sequentially...

Additive functions on trees

Piroska Lakatos (2001)

Colloquium Mathematicae

Similarity:

The motivation for considering positive additive functions on trees was a characterization of extended Dynkin graphs (see I. Reiten [R]) and applications of additive functions in representation theory (see H. Lenzing and I. Reiten [LR] and T. Hübner [H]). We consider graphs equipped with integer-valued functions, i.e. valued graphs (see also [DR]). Methods are given for constructing additive functions on valued trees (in particular on Euclidean graphs) and for characterizing...

Minimal forbidden subgraphs of reducible graph properties

Amelie J. Berger (2001)

Discussiones Mathematicae Graph Theory

Similarity:

A property of graphs is any class of graphs closed under isomorphism. Let ₁,₂,...,ₙ be properties of graphs. A graph G is (₁,₂,...,ₙ)-partitionable if the vertex set V(G) can be partitioned into n sets, V₁,V₂,..., Vₙ, such that for each i = 1,2,...,n, the graph G [ V i ] ∈ i . We write ₁∘₂∘...∘ₙ for the property of all graphs which have a (₁,₂,...,ₙ)-partition. An additive induced-hereditary property is called reducible if there exist additive induced-hereditary properties ₁ and ₂ such that = ₁∘₂....

Representations of bimeasures

Kari Ylinen (1993)

Studia Mathematica

Similarity:

Separately σ-additive and separately finitely additive complex functions on the Cartesian product of two algebras of sets are represented in terms of spectral measures and their finitely additive counterparts. Applications of the techniques include a bounded joint convergence theorem for bimeasure integration, characterizations of positive-definite bimeasures, and a theorem on decomposing a bimeasure into a linear combination of positive-definite ones.

A survey of hereditary properties of graphs

Mieczysław Borowiecki, Izak Broere, Marietjie Frick, Peter Mihók, Gabriel Semanišin (1997)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we survey results and open problems on the structure of additive and hereditary properties of graphs. The important role of vertex partition problems, in particular the existence of uniquely partitionable graphs and reducible properties of graphs in this structure is emphasized. Many related topics, including questions on the complexity of related problems, are investigated.