Print

# 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

 11 - 20 / 27123 11.Distance-transitive graphs admit semiregular automorphismsKlavdija Kutnar, Primož Šparl, 2010, original scientific articleAbstract: A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and ▫$(u',v')$▫ such that the distance between ▫$u$▫ and ▫$v$▫ is equal to the distance between ▫$u'$▫ and ▫$v'$▫ there exists an automorphism of the graph mapping ▫$u$▫ to ▫$u'$▫ and ▫$v$▫ to ▫$v'$▫. A semiregular element of a permutation group is anon-identity element having all cycles of equal length in its cycle decomposition. It is shown that every distance-transitive graph admits a semiregular automorphism.Found in: osebiKeywords: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation groupPublished: 15.10.2013; Views: 1752; Downloads: 62 Full text (0,00 KB) 12.A note on a geometric construction of large Cayley graps of given degree and diameterGyörgy Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2008, published scientific conference contribution abstractFound in: osebiKeywords: diameter-degree problem, Cayley graph, projective spacePublished: 15.10.2013; Views: 1812; Downloads: 12 Full text (0,00 KB) 13.A note on a geometric construction of large Cayley graps of given degree and diameterGyörgy Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, original scientific articleAbstract: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces.Found in: osebiKeywords: degree, diameter problem, Moore bound, finite projective spacesPublished: 15.10.2013; Views: 1697; Downloads: 24 Full text (0,00 KB)This document has more files! More... 14.Simetrije cirkulantnih grafovMaruša Saksida, 2014, master's thesisFound in: osebiKeywords: cirkulantni graf, točkovna tranzitivnost, povezavna tranzitivnost, ločna tranzitivnost, izomorfizem, grupa avtomorfizmov, ciklični indeks, normalen cirkulantPublished: 10.07.2015; Views: 2194; Downloads: 16 Full text (0,00 KB)This document has more files! More... 15.EditorialŠtefko Miklavič, Primož Šparl, Klavdija Kutnar, Tomaž Pisanski, 2015, preface, afterwordFound in: osebiPublished: 15.10.2015; Views: 778; Downloads: 9 Full text (0,00 KB) 16.Reachability relations in digraphsNorbert Seifter, Boris Zgrablić, Aleksander Malnič, Primož Šparl, Dragan Marušič, 2008, original scientific articleAbstract: In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed in the direction opposite to their orientation. Then, a vertex ▫$u$▫ is ▫$R_k^+$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at u has weight in the interval ▫$[0,k]$▫. Similarly, a vertex ▫$u$▫ is ▫$R_k^-$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at ▫$u$▫ has weight in the interval ▫$[-k,0]$▫. For all positive integers ▫$k$▫, the relations ▫$R_k^+$▫ and ▫$R_k^-$▫ are equivalence relations on the vertex set of a given digraph. We prove that, for transitive digraphs, properties of these relations are closely related to other properties such as having property ▫$\mathbb{Z}$▫, the number of ends, growth conditions, and vertex degree.Found in: osebiKeywords: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growthPublished: 03.04.2017; Views: 944; Downloads: 91 Full text (0,00 KB) 17.Symmetry structure of bicirculantsBoštjan Frelih, Primož Šparl, Aleksander Malnič, Dragan Marušič, 2007, original scientific articleAbstract: An ▫$n$▫-bicirculant is a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. Symmetry properties of ▫$p$▫-bicirculants, ▫$p$▫ a prime, are extensively studied. In particular, the actions of their automorphism groups are described in detail in terms of certain algebraic representation of such graphs.Found in: osebiKeywords: mathematics, graph theory, graph, circulant, bicirculant, automorphism groupPublished: 03.04.2017; Views: 1047; Downloads: 59 Full text (0,00 KB) 18.On strongly regular bicirculantsDragan Marušič, Aleksander Malnič, Primož Šparl, 2007, original scientific articleAbstract: An ▫$n$▫-bicirculantis a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. This article deals with strongly regular bicirculants. It is known that for a nontrivial strongly regular ▫$n$▫-bicirculant, ▫$n$▫ odd, there exists a positive integer m such that ▫$n=2m^2+2m+1▫$. Only three nontrivial examples have been known previously, namely, for ▫$m=1,2$▫ and 4. Case ▫$m=1$▫ gives rise to the Petersen graph and its complement, while the graphs arising from cases ▫$m=2$▫ and ▫$m=4$▫ are associated with certain Steiner systems. Similarly, if ▫$n$▫ is even, then ▫$n=2m^2$▫ for some ▫$m \ge 2$▫. Apart from a pair of complementary strongly regular 8-bicirculants, no other example seems to be known. A necessary condition for the existence of a strongly regular vertex-transitive ▫$p$▫-bicirculant, ▫$p$▫ a prime, is obtained here. In addition, three new strongly regular bicirculants having 50, 82 and 122 vertices corresponding, respectively, to ▫$m=3,4$▫ and 5 above, are presented. These graphs are not associated with any Steiner system, and together with their complements form the first known pairs of complementary strongly regular bicirculants which are vertex-transitive but not edge-transitive.Found in: osebiKeywords: mathematics, graph theory, graph, circulant, bicirculant, automorphism groupPublished: 03.04.2017; Views: 1168; Downloads: 54 Full text (0,00 KB) 19.Classification of quartic half-arc-transitive weak metacirculants of girth at most 4Iva Antončič, Primož Šparl, 2016, original scientific articleFound in: osebiKeywords: half-arc-transitive, weak metacirculant, quartic, girth at most 4Published: 08.08.2016; Views: 876; Downloads: 111 Full text (0,00 KB) 20.On structural results of tetravalent half-arc-transitive graphsPrimož Šparl, 2018, published scientific conference contribution abstract (invited lecture)Found in: osebiKeywords: graph, half-arc-transitive, alternating cycle, radiusPublished: 07.02.2018; Views: 551; Downloads: 13 Full text (0,00 KB)
Search done in 0 sec.