TY - JOUR
T1 - A class of additive multiplicative graph functions
AU - Hsu, Lih Hsing
AU - Chen, Chiuyuan
AU - Jean, En Yih
PY - 1987/1/1
Y1 - 1987/1/1
N2 - For a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/n , where γG(H) is the maximum number of disjoint G's in H. In [2], Hsu proved that PK2
is multiplicative or not. In this paper, we prove that PG is multiplicative and additive for some graphs G which include K2. Some properties of PG are also discussed in this paper.
AB - For a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/n , where γG(H) is the maximum number of disjoint G's in H. In [2], Hsu proved that PK2
is multiplicative or not. In this paper, we prove that PG is multiplicative and additive for some graphs G which include K2. Some properties of PG are also discussed in this paper.
UR - http://www.scopus.com/inward/record.url?scp=0347958402&partnerID=8YFLogxK
U2 - 10.1016/0012-365X(87)90210-X
DO - 10.1016/0012-365X(87)90210-X
M3 - Article
AN - SCOPUS:0347958402
SN - 0012-365X
VL - 65
SP - 53
EP - 63
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1
ER -