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 / 10
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
The automorphism groups of non-edge transitive rose window graphs
Edward 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: 961; Prenosov: 19
.pdf Celotno besedilo (275,74 KB)

3.
4.
5.
6.
Classification of nilpotent 3-BCI-groups
Sergio Hiroki Koike Quintanar, István Kovács, 2018, izvirni znanstveni članek

Ključne besede: bi-Cayley graph, BCI-group, graph isomorphism
Objavljeno v RUP: 02.03.2018; Ogledov: 20212; Prenosov: 66
URL Povezava na celotno besedilo

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

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

8.
Generalized cages
Marko Boben, Robert Jajcay, Tomaž Pisanski, 2015, izvirni znanstveni članek

Ključne besede: cage, graph, isomorphism
Objavljeno v RUP: 03.04.2017; Ogledov: 2187; Prenosov: 71
URL Povezava na celotno besedilo

9.
10.
Isomorphism checking of I-graphs
Boris Horvat, Tomaž Pisanski, Arjana Žitnik, 2012, izvirni znanstveni članek

Opis: We consider the class of ▫$I$▫-graphs, which is a generalization of the class of the generalized Petersen graphs. We show that two ▫$I$▫-graphs ▫$I(n, j, k)$▫ and ▫$I(n, j_1, k_1)$▫ are isomorphic if and only if there exists an integer ▫$a$▫ relatively prime to $n$ such that either ▫$\{j_1, k_1\} = \{aj \mod n, \; ak \mod n \}$▫ or ▫$\{j_1, k_1\} = \{aj \mod n, \; -ak \mod n\}$▫. This result has an application in the enumeration of non-isomorphic ▫$I$▫-graphs and unit-distance representations of generalized Petersen graphs.
Ključne besede: mathematics, graph theory, isomorphism, I-graph, generalized Petersen graph
Objavljeno v RUP: 15.10.2013; Ogledov: 4091; Prenosov: 136
URL Povezava na celotno besedilo

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