On the simplex graph operator

• Autorzy: Bohdan Zelinka
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

simplex of a graph; simplex operator; limit cardinal number

Kategorie tematyczne

• 05C75: Structural characterization of families of graphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 1998
• Tom: 18
• Numer: 2
• Strony: 165-169

Daty

wydano

1998

otrzymano

1997-10-15

poprawiono

1998-03-18

Twórcy

autor

Bohdan Zelinka

• Department of Applied Mathematics, Faculty of Education, Technical University of Liberec, Voronežská 13, 461 17 Liberec, Czech Republic

Bibliografia

• [1] E. Prisner, Graph dynamics, Longman House, Burnt Mill, Harlow, Essex 1995.

Identyfikatory

DOI

10.7151/dmgt.1072