scientific article; zbMATH DE number 15373

[For the entire collection see Zbl 0698.00017.] A hypergraph \(X\) is a finite non-empty set \(V(X)\) together with a collection \(E(X)\) of distinct non-empty subsets of \(V(X)\). Elements of \(V(X)\) are called vertices and those of \(E(X)\) edges of the hypergraph \(X\). An edge consisting of only one vertex is called a loop. All hypergraphs considered in this paper are without loops. Let \(X\) and \(Y\) be two hypergraphs. A bijection \(\theta:V(X)\to V(Y)\) with the property that \(B\in E(X)\) iff \(B\theta\in E(Y)\) is called an isomorphism from \(X\) onto \(Y\), an in this case \(X\) and \(Y\) are isomorphic. An isomorphism from a hypergraph \(X\) onto itself is called an automorphism. A hypergraph \(X\) is said to be point-symmetric if for every \(x,y\in V(X)\), there exists an automorphism \(\theta\) of \(X\) such that \(x\theta=y\). Point-colour- symmetric graphs are graphs with high symmetrical properties. A characterization of point-colour-symmetric graphs can be found in \textit{C. C. Chen} and \textit{H. H. Teh} [J. Comb. Theory, Ser. B 27, 160-167 (1979; Zbl 0418.05045)]. In this paper we shall extend the above characterization to hypergraphs.

Recommendations

Cited in

(5)

This page was built for publication:

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