Clique graphs of packed graphs (Q1082356): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4187840 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On clique-critical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum number of cliques in dense graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(86)90048-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992845860 / rank | |||
Normal rank | |||
Latest revision as of 10:02, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clique graphs of packed graphs |
scientific article |
Statements
Clique graphs of packed graphs (English)
0 references
1986
0 references
Let \(| G|\) be the number of vertices of a graph G and \(\omega\) (G) the number of vertices in the largest clique of G. The clique graph K(G) is the intersection graph of the cliques of G. For all G, \(| K(G)| \leq 2^{| G| -\omega (G)}\) [see \textit{B. Hedman}, Discrete Math. 54, 161-166 (1986; Zbl 0569.05029)] and G is called packed if this is an equality. This paper corrects the characterization of the clique graphs of packed graphs given by Hedman.
0 references
density
0 references
Neumann graph
0 references
clique graphs
0 references
packed graphs
0 references
