A k-bowtie is the graph consisting of two cycles of lenght k, having exactly one vertex in common. A k-bowtie system of order v is a pair (X; B), where X is a nite set of v vertices and B is a collection of edge disjoint k-bowties (called blocks) which partitions the edge set of the complete graph Kn, dened in X. In this paper we study 4-bowtie systems. We determine the spectrum of all types of balanced 4-bowtie systems. Mathematics Subject Classication: 05B05
Strongly balanced four bowtie systems
GIONFRIDDO, Mario;MILICI, Salvatore
2014-01-01
Abstract
A k-bowtie is the graph consisting of two cycles of lenght k, having exactly one vertex in common. A k-bowtie system of order v is a pair (X; B), where X is a nite set of v vertices and B is a collection of edge disjoint k-bowties (called blocks) which partitions the edge set of the complete graph Kn, dened in X. In this paper we study 4-bowtie systems. We determine the spectrum of all types of balanced 4-bowtie systems. Mathematics Subject Classication: 05B05File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
