Symmetric graph designs on friendship graphs

dc.contributor.authorFronček, Dalibor
dc.contributor.authorRosa, Alexander
dc.date.accessioned2006-11-10T06:03:19Z
dc.date.available2006-11-10T06:03:19Z
dc.date.issued2000
dc.description.abstract-enWe settle completely the existence of symmetric graph designs on friendship graphsen
dc.identifier.citationJournal of Combinatorial Designs. 2000, vol. 8, issue 3, p. 201-206.en
dc.identifier.doi10.1002/(sici)1520-6610(2000)8:3<201::aid-jcd5>3.3.co;2-r
dc.identifier.issn1063-8539
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.urihttp://hdl.handle.net/10084/58031
dc.identifier.wos000086592900005
dc.language.isoenen
dc.publisherWileyen
dc.relation.ispartofseriesJournal of Combinatorial Designsen
dc.relation.urihttps://doi.org/10.1002/(sici)1520-6610(2000)8:3<201::aid-jcd5>3.3.co;2-ren
dc.subjectsymmetric graph designen
dc.subjectfriendship graphen
dc.titleSymmetric graph designs on friendship graphsen
dc.typearticleen

Files