Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


11 - 20 / 27
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
11.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Objavljeno: 15.10.2013; Ogledov: 1706; Prenosov: 58
URL Polno besedilo (0,00 KB)

12.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2008, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: osebi
Ključne besede: diameter-degree problem, Cayley graph, projective space
Objavljeno: 15.10.2013; Ogledov: 1749; Prenosov: 12
URL Polno besedilo (0,00 KB)

13.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: degree, diameter problem, Moore bound, finite projective spaces
Objavljeno: 15.10.2013; Ogledov: 1644; Prenosov: 23
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

14.
Simetrije cirkulantnih grafov
Maruša Saksida, 2014, magistrsko delo

Najdeno v: osebi
Ključne besede: cirkulantni graf, točkovna tranzitivnost, povezavna tranzitivnost, ločna tranzitivnost, izomorfizem, grupa avtomorfizmov, ciklični indeks, normalen cirkulant
Objavljeno: 10.07.2015; Ogledov: 2134; Prenosov: 16
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

15.
Editorial
Štefko Miklavič, Primož Šparl, Klavdija Kutnar, Tomaž Pisanski, 2015, predgovor, spremna beseda

Najdeno v: osebi
Objavljeno: 15.10.2015; Ogledov: 749; Prenosov: 9
URL Polno besedilo (0,00 KB)

16.
Reachability relations in digraphs
Norbert Seifter, Boris Zgrablić, Aleksander Malnič, Primož Šparl, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Objavljeno: 03.04.2017; Ogledov: 889; Prenosov: 83
URL Polno besedilo (0,00 KB)

17.
Symmetry structure of bicirculants
Boštjan Frelih, Primož Šparl, Aleksander Malnič, Dragan Marušič, 2007, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno: 03.04.2017; Ogledov: 997; Prenosov: 55
URL Polno besedilo (0,00 KB)

18.
On strongly regular bicirculants
Dragan Marušič, Aleksander Malnič, Primož Šparl, 2007, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: mathematics, graph theory, graph, circulant, bicirculant, automorphism group
Objavljeno: 03.04.2017; Ogledov: 1095; Prenosov: 49
URL Polno besedilo (0,00 KB)

19.
Classification of quartic half-arc-transitive weak metacirculants of girth at most 4
Iva Antončič, Primož Šparl, 2016, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: half-arc-transitive, weak metacirculant, quartic, girth at most 4
Objavljeno: 08.08.2016; Ogledov: 830; Prenosov: 102
URL Polno besedilo (0,00 KB)

20.
On structural results of tetravalent half-arc-transitive graphs
Primož Šparl, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: osebi
Ključne besede: graph, half-arc-transitive, alternating cycle, radius
Objavljeno: 07.02.2018; Ogledov: 492; Prenosov: 13
URL Polno besedilo (0,00 KB)

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici