A class of additive multiplicative graph functions
From MaRDI portal
For a fixed graph G, the capacity function for G, \(P_ G\), is defined by \(P_ G(H)=\lim_{n\to \infty}[\nu_ G(H\quad n)]^{1/n},\) where \(\nu_ G(H)\) is the maximum number of disjoint G's in H. Hsu proved that \(P_{K_ 2}\) can be viewed as a lower bound for multiplicative increasing graph functions. But it was not known whether \(P_{K_ 2}\) is multiplicative or not. In this paper, they prove that \(P_ G\) is multiplicative and additive for some graphs G which include \(K_ 2\). Some properties of \(P_ G\) are also discussed in this paper.
Recommendations
Cites work
Cited in
(7)- scientific article; zbMATH DE number 4019088 (Why is no real title available?)
- scientific article; zbMATH DE number 3968631 (Why is no real title available?)
- scientific article; zbMATH DE number 4127270 (Why is no real title available?)
- scientific article; zbMATH DE number 4118412 (Why is no real title available?)
- scientific article; zbMATH DE number 870135 (Why is no real title available?)
- Generalized homomorphism graph functions
- Interaction graphs: additives
This page was built for publication: A class of additive multiplicative graph functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103643)