A class of clique-closed graphs (Q1322222): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Über iterierte Clique-Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clique graphs of time graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3953806 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Graphs Without Multicliqual Edges / rank | |||
Normal rank |
Revision as of 14:32, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of clique-closed graphs |
scientific article |
Statements
A class of clique-closed graphs (English)
0 references
10 October 1994
0 references
A family \(F\) of graphs is clique-closed, if the clique graph of any graph in \(F\) is again in \(F\), and any graph in the family \(F\) is the clique graph of some graph in \(F\). Consider the family \(F\) of all finite connected graphs \(G\) having the following two properties: (1) Every set of cliques of \(G\), no two of which are disjoint, has nonempty total intersection. (2) For any two distinct vertices \(x\) and \(y\), there exist cliques \(C\) and \(D\) such that \(x\) is in \(C-D\) and \(y\) is in \(D-C\). The authors prove that the family \(F\) is clique-closed.
0 references
clique-closed graphs
0 references
clique graph
0 references
cliques
0 references