The notion of Desarguesian closure of an arbitrary graph was introduced in [7], and basic properties of Desarguesian closure of complete graphs were also presented in [7]. Then, in [4], the Desarguesian closure of binomial graphs (cf. [5]) was studied. In this paper we shall be mainly concerned with the line graphs associated with complete graphs, their Desarguesian closure, horizon, and automorphisms.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In the paper we study configurations which are obtained as Desarguesian closure of binomial graphs. Their parameters are calculated, and their automorphisms are determined.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.