A class of clique-closed graphs (Q1322222): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)00472-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045476939 / rank
 
Normal rank

Latest revision as of 09:11, 30 July 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
    0 references
    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

    Identifiers