Title of article
G-DESIGNS FOR THE CONNECTED TRIANGULAR BICYCLIC GRAPHS WITH NINE EDGES
Author/Authors
Freyberg ، Bryan Department of Mathematics and Statistics - University of Minnesota Duluth , Froncek ، Dalibor Department of Mathematics and Statistics - University of Minnesota Duluth , Jeffries ، Joel Department of Mathematics - Iowa State University , Jensen ، Gretta Department of Mathematics and Statistics - University of Minnesota Duluth , Sailstad ، Andrew School of Mathematics - University of Minnesota
From page
271
To page
281
Abstract
A G-design of order n is a decomposition of the complete graph Kn into isomorphic copies of G. We show that if G is a connected bicyclic graph with nine edges containing two triangles, a G-design of order n exists whenever n ≡ 0,1 (mod 18).
Keywords
graph decomposition , bicyclic graphs , rho , labelings
Journal title
Transactions on Combinatorics
Journal title
Transactions on Combinatorics
Record number
2772559
Link To Document