Relative capacity and dimension of graphs

https://doi.org/10.1016/S0012-365X(00)00283-1Get rights and content
Under an Elsevier user license
open archive

Abstract

A slight modification of our old definition of relative Shannon capacity of a graph with respect to another one is shown to be relevant to the Nešetřil–Pultr dimension of graphs. We give an upper bound for relative capacity in terms of graph entropy.

Cited by (0)

1

Research of this author was partially supported by the Hungarian National Foundation for Scientific Research OTKA Grant No. T 026041.