|
|
|
|
g-designs for the connected triangular bicyclic graphs with nine edges
|
|
|
|
|
|
|
|
نویسنده
|
freyberg bryan ,froncek dalibor ,jeffries joel ,jensen gretta ,sailstad andrew
|
|
منبع
|
transactions on combinatorics - 2025 - دوره : 14 - شماره : 4 - صفحه:271 -281
|
|
چکیده
|
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).
|
|
کلیدواژه
|
graph decomposition ,bicyclic graphs ,rho-labelings
|
|
آدرس
|
university of minnesota duluth, department of mathematics and statistics, usa, university of minnesota duluth, department of mathematics and statistics, usa, iowa state university, department of mathematics, usa, university of minnesota duluth, department of mathematics and statistics, usa, university of minnesota, school of mathematics, usa
|
|
پست الکترونیکی
|
sails008@umn.edu
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|