On the simplex graph operator

@article{BohdanZelinka1998,
abstract = {A simplex of a graph G is a subgraph of G which is a complete graph. The simplex graph Simp(G) of G is the graph whose vertex set is the set of all simplices of G and in which two vertices are adjacent if and only if they have a non-empty intersection. The simplex graph operator is the operator which to every graph G assigns its simplex graph Simp(G). The paper studies graphs which are fixed in this operator and gives a partial answer to a problem suggested by E. Prisner.},
author = {Bohdan Zelinka},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {simplex of a graph; simplex operator; limit cardinal number; clique; simplex graph; infinite graph},
language = {eng},
number = {2},
pages = {165-169},
title = {On the simplex graph operator},
url = {http://eudml.org/doc/270190},
volume = {18},
year = {1998},
}

TY - JOUR
AU - Bohdan Zelinka
TI - On the simplex graph operator
JO - Discussiones Mathematicae Graph Theory
PY - 1998
VL - 18
IS - 2
SP - 165
EP - 169
AB - A simplex of a graph G is a subgraph of G which is a complete graph. The simplex graph Simp(G) of G is the graph whose vertex set is the set of all simplices of G and in which two vertices are adjacent if and only if they have a non-empty intersection. The simplex graph operator is the operator which to every graph G assigns its simplex graph Simp(G). The paper studies graphs which are fixed in this operator and gives a partial answer to a problem suggested by E. Prisner.
LA - eng
KW - simplex of a graph; simplex operator; limit cardinal number; clique; simplex graph; infinite graph
UR - http://eudml.org/doc/270190
ER -