
doi: 10.1007/bf01586938
The author introduces four types of norms on \(R^ n\) derived on the basis of the family of all maximal cliques of an \(n\)-vertex graph (or its complement) and related to the fractional vertex packing polytope of the graph. The goal of the paper is to demonstrate the usefulness of employing techniques of functional analysis to obtain results in graph theory that are related to the norms considered.
Graph theory, norm, perfect graph, reflexivity, maximal cliques, vertex packing polytope
Graph theory, norm, perfect graph, reflexivity, maximal cliques, vertex packing polytope
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
