Clique graphs of packed graphs

DOI10.1016/0012-365X(86)90048-8MaRDI QIDQ1082356zbMATH OpenOpenAlexFDO

Authors Iwao Sato

Publication date 1986

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(86)90048-8

zbMATH Keywords

clique graphsdensityNeumann graphpacked graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Review text

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.

Recommendations

• Enumeration of packed graphs
• The maximum number of cliques in dense graphs
• scientific article; zbMATH DE number 19181
• scientific article; zbMATH DE number 1189244
• On clique graphs with linear size

Cites work

• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• On clique-critical graphs
• The maximum number of cliques in dense graphs

Cited in

(4)

• The maximum number of cliques in dense graphs
• Clique-gated graphs
• Enumeration of packed graphs
• On the maximum number of cliques in a graph

This page was built for publication: Clique graphs of packed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082356)