A class of additive multiplicative graph functions

Lih Hsing Hsu*, Chiuyuan Chen, En Yih Jean

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)53-63
Number of pages11
JournalDiscrete Mathematics
Volume65
Issue number1
DOIs
StatePublished - 1 Jan 1987

Fingerprint Dive into the research topics of 'A class of additive multiplicative graph functions'. Together they form a unique fingerprint.

Cite this