# Search the repository

 Query: search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing Work type: All work types Habilitation (m4) Specialist thesis (m3) High school thesis (m6) Bachelor work * (dip) Master disertations * (mag) Doctorate disertations * (dok) Research Data or Corpuses (data) * old and bolonia study programme Language: All languagesSlovenianEnglishGermanCroatianSerbianBosnianBulgarianCzechFinnishFrenchGerman (Austria)HungarianItalianJapaneseLithuanianNorwegianPolishRussianSerbian (cyrillic)SlovakSpanishSwedishTurkishUnknown Search in: RUP    FAMNIT - Faculty of Mathematics, Science and Information Technologies    FHŠ - Faculty of Humanities    FM - Faculty of Management    FTŠ Turistica - Turistica – College of Tourism Portorož    FVZ - Faculty of Health Sciences    IAM - Andrej Marušič Institute    PEF - Faculty of Education    UPR - University of PrimorskaCOBISS    Fakulteta za humanistične študije, Koper    Fakulteta za management Koper in Pedagoška fakulteta Koper    Fakulteta za vede o zdravju, Izola    Knjižnica za tehniko, medicino in naravoslovje, Koper    Turistica, Portorož    Znanstveno-raziskovalno središče Koper Options: Show only hits with full text Reset

 1 - 5 / 51 1.Distance-regular Cayley graphs on dihedral groupsŠtefko Miklavič, Primož Potočnik, 2007, original scientific articleAbstract: The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every non-trivial distance-regular Cayley graph on a dihedral group is bipartite, non-antipodal, has diameter 3 and arises either from a cyclic di#erence set, or possibly (if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all distance-transitive Cayley graphs on dihedral groups are determined. It transpires that a Cayley graph on a dihedral group is distance-transitive if and only if it is trivial, or isomorphic to the incidence or to the non-incidence graph of a projective space ▫$\mathrm{PG}_{d-1} (d,q)$▫, ▫$d \ge 2$▫, or the unique pair of complementary symmetric designs on 11 vertices.Found in: ključnih besedahSummary of found: ...(if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all...Keywords: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference setPublished: 15.10.2013; Views: 1277; Downloads: 57 Full text (0,00 KB) 2.Distance-regular Cayley graphs on dihedral groupsPrimož Potočnik, Štefko Miklavič, 2005, original scientific articleAbstract: The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every non-trivial distance-regular Cayley graph on a dihedral group is bipartite, non-antipodal, has diameter 3 and arises either from a cyclic di#erence set, or possibly (if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all distance-transitive Cayley graphs on dihedral groups are determined. It transpires that a Cayley graph on a dihedral group is distance-transitive if and only if it is trivial, or isomorphic to the incidence or to the non-incidence graph of a projective space ▫$\mathrm{PG}_{d-1} (d,q)$▫, ▫$d \ge 2$▫, or the unique pair of complementary symmetric designs on 11 vertices.Found in: ključnih besedahSummary of found: ...(if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all...Keywords: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference setPublished: 10.07.2015; Views: 882; Downloads: 47 Full text (0,00 KB) 3.Karakterizacija posplošnih zlomljenih funkcij in nekatere druge kriptografske temeSamir Hodžić, 2017, doctoral dissertationFound in: ključnih besedahSummary of found: ...bent functions, Zq-bent functions, Gray maps, (relative) difference sets, (generalized) Marioana-McFarland class, stream ciphers, filtering...Keywords: generalized bent functions, Zq-bent functions, Gray maps, (relative) difference sets, (generalized) Marioana-McFarland class, stream ciphers, filtering generator, guess and determine cryptanalysis, tap positions, (fast) algebraic attacks, algebraic immunity, derivatives, linear structures, planar mappingsPublished: 09.11.2017; Views: 749; Downloads: 11 Full text (0,00 KB) 4.Full characterization of generalized bent functions as (semi)-bent spaces, their dual, and the Gray imageSamir Hodžić, Wilfried Meidl, Enes Pašalić, 2018, original scientific articleFound in: ključnih besedahSummary of found: ...maps, dual of generalized bent function, relative difference sets...Keywords: generalized bent functions, Zq-bent functions, Gray maps, dual of generalized bent function, relative difference setsPublished: 08.06.2018; Views: 404; Downloads: 18 Full text (0,00 KB) 5.Full characterization of generalized bent functions as (semi)-bent spaces, their dual, and the Gray imageSamir Hodžić, Wilfried Meidl, Enes Pašalić, 2018, original scientific articleFound in: ključnih besedahSummary of found: ...maps, dual of generalized bent function, relative difference sets...Keywords: generalized bent functions, Zq-bent functions, Gray maps, dual of generalized bent function, relative difference setsPublished: 08.06.2018; Views: 470; Downloads: 21 Full text (0,00 KB)
Search done in 0 sec.