A theorem in additive number theory
Roger Crocker (1969)
Colloquium Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Additive functions on trees”
A theorem in additive number theory
On additive functions having a non-decreasing normal order
I. Kátai (1977)
Colloquium Mathematicae
Similarity:
On additive functions with a non-decreasing normal order
W. Narkiewicz (1974)
Colloquium Mathematicae
Similarity:
On the continuity of certain non-additive set functions
L. Drewnowski (1978)
Colloquium Mathematicae
Similarity:
Integral representation of additive transformations on spaces
Utpal Bandyopadhyay (1973)
Studia Mathematica
Similarity:
Approximately additive set functions
Bogdan Pawlik (1987)
Colloquium Mathematicae
Similarity:
On some modifications of two theorems of Erdős
Katalin Kovács (1998)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
On the determination of an additive arithmetical function by its local behaviour
I. Kátai (1969)
Colloquium Mathematicae
Similarity:
On a characterization of graphs by average labellings
Matúš Harminc (1997)
Discussiones Mathematicae Graph Theory
Similarity:
The additive hereditary property of linear forests is characterized by the existence of average labellings.
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...
On strongly additive set functions
Z. Lipecki (1971)
Colloquium Mathematicae
Similarity:
On subaddidive and Ψ-additive mappings
Janusz Matkowski (2004)
Open Mathematics
Similarity:
Problem 24 of the "Scottish book'' concerning additive functionals
Iwo Labuda, R. Daniel Mauldin (1984)
Colloquium Mathematicae
Similarity: