✦ LIBER ✦

A class of additive multiplicative graph functions

✍ Scribed by Lih-Hsing Hsu; Chiuyuan Chen; En-Yih Jean

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 650 KB
Volume: 65
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90210-x

No coin nor oath required. For personal study only.

✦ Synopsis

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 multiplicative or not. In this paper, we prove that Pc is multiplicative and additive for some graphs G which include K2. Some properties of Pc are also discussed in this paper.

📜 SIMILAR VOLUMES

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

A classification of graph capacity funct

A classification of graph capacity functions

✍ Hsu, Lih-Hsing 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

Given two graphs G = (V(G), QG)) and H = (V(H), €(H)), the sum of G and H, G + H, is the disjoint union of G and H. The product of G and H, G X H, is the graph with the vertex set V(G x H) that is the Cartesian product of V(G) and V(H), and two vertices (gl, h l ) , (92, h2) are adjacent if and only

A characterization of finitely distribut

A characterization of finitely distributed additive functions

✍ C Ryavec 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 415 KB

Skeletal graphs — a new class of perfect

Skeletal graphs — a new class of perfect graphs

✍ A. Hertz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro

On a Conjecture of Kátai for Additive Fu

On a Conjecture of Kátai for Additive Functions

✍ Eduard Wirsing; Tang Yuan-sheng; Shao Pin-tsung 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Ka tai himself gave partial solutions. In he proved that &2f (n)&=0(n &1 ) ( 3 ) article no. 0027

A class of upper-embeddable graphs

✍ F. Jaeger; C. Payan; N. H. Xuong 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract In this paper, we prove the following result: Every graph obtained by connecting (with any number of edges) two vertex‐disjoint upper‐embeddable graphs graphs with even Betti number is upper‐embeddable.