✦ LIBER ✦

On the graph of a quasi-additive function

✍ Scribed by M. Baran

Publisher: Springer
Year: 1990
Tongue: English
Weight: 230 KB
Volume: 39
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01833143

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A theorem on the additivity of the quasi

A theorem on the additivity of the quasi-concave closure of an additive convex function

✍ Uzi Segal 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 254 KB

A class of additive multiplicative graph

A class of additive multiplicative graph functions

✍ Lih-Hsing Hsu; Chiuyuan Chen; En-Yih Jean 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 650 KB

For a fixed graph G, the capacity function for G, Po, is defined by Pc(H)= lim,\_\_,®[yo(H')] TM, where y6(H) is the maximum number of disjoint G's in H. In , Hsu proved that Pr2 can be viewed as a lower bound for multiplicative increasing graph functions. But it was not known whether Pr2 is multipl

On the Natural Imprint Function of a Gra

On the Natural Imprint Function of a Graph

✍ Boštjan Brešar 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 130 KB

In this paper, some characterizations of median and quasi-median graphs are extended to general isometric subgraphs of Cartesian products using the concept of an imprint function as introduced by Tardif. This extends the well known concepts of medians in median graphs as well as imprints in quasi-me

Extending a function on a graph

✍ D.F. Robinson 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 913 KB

Let G be a graph with vertex set V, and let h be a function mapping a subset U of I/ into the real numbers R. If f is a function from I' to R, we define S y) to be the sum of If(b)f(a)1 over all edges {a, b} of G. A best extension of h is such a function f with f(x) = h(x) for x E U and minimum 6 u

A Note on the Zeta Function of a Graph

✍ Sam Northshield 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The number of spanning trees in a finite graph is first expressed as the derivative (at 1) of a determinant and then in terms of a zeta function. This generalizes a result of Hashimoto to non-regular graphs. ## 1998 Academic Press Let G be a finite graph. The complexity of G, denoted }, is the num

On a multiplicative graph function conje

On a multiplicative graph function conjecture

✍ Lih-Hsing Hsu 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 802 KB

For any graph H, the function h,. defined by setting h,(G) equal to the number of homomorphisms from G into H, is a multiplicative increasing function. L.ov&sz [2] has asked whether ail nonzero multiplicative increasing functions are generated by functions of this type. We show that this is not the