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


1 - 10 / 26
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
On cubic vertex-transitive graphs of given girth
Edward Tauscher Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner, 2025, izvirni znanstveni članek

Opis: A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs are well known if they are 1-arc-transitive, or if they have two edge orbits and either have girth 3 or vertex-stabilizers of order 1 or 2. There are many results about vertex-transitive cubic graphs of girth 4 with two edge orbits, but for larger girth almost nothing is known about the distinguishing costs of such graphs. We prove that cubic vertex-transitive graphs of girth 5 with two edge orbits have distinguishing cost 2, and prove the non-existence of infinite 3-arc-transitive cubic graphs of girth 6.
Ključne besede: distinguishing number, distinguishing cost, vertex-transitive cubic graphs, automorphisms
Objavljeno v RUP: 27.08.2025; Ogledov: 678; Prenosov: 4
.pdf Celotno besedilo (451,52 KB)
Gradivo ima več datotek! Več...

2.
3.
The automorphism groups of non-edge transitive rose window graphs
Edward Tauscher Dobson, István Kovács, Štefko Miklavič, 2015, izvirni znanstveni članek

Opis: In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs.
Ključne besede: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph
Objavljeno v RUP: 31.12.2021; Ogledov: 2562; Prenosov: 43
.pdf Celotno besedilo (275,74 KB)

4.
Phd summer school in discrite mathematics
Marston D. E. Conder, Edward Tauscher Dobson, Tatsuro Ito, 2013

Objavljeno v RUP: 07.11.2021; Ogledov: 1954; Prenosov: 23
.pdf Celotno besedilo (9,83 MB)

5.
6.
7.
8.
Some new groups which are not CI-groups with respect to graphs
Edward Tauscher Dobson, 2018, izvirni znanstveni članek

Ključne besede: Cayley graph, CI-group, isomorphism
Objavljeno v RUP: 21.02.2018; Ogledov: 4667; Prenosov: 162
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

9.
Imprimitive permutations in primitive groups
Joao Araújo, J. P. Araújo, Peter J. Cameron, Edward Tauscher Dobson, A. Hulpke, P. Lopes, 2017, izvirni znanstveni članek

Ključne besede: primitive groups, imprimitive groups, GAP, permutation type
Objavljeno v RUP: 21.02.2018; Ogledov: 4369; Prenosov: 261
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

10.
On isomorphism and multiplier inequivalence of cyclic steiner quadruple systems
Edward Tauscher Dobson, Tao Feng, Derek F. Holt, Patric R. J. Östergård, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: isomorphism, cyclic Steiner quadruple system, automorphism
Objavljeno v RUP: 07.02.2018; Ogledov: 4441; Prenosov: 45
URL Povezava na celotno besedilo

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