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 - 9 / 9
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Classification of cubic symmetric tricirculants
István Kovács, Klavdija Kutnar, Dragan Marušič, Stephen Wilson, 2012, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...symmetric graph, semiregular, tricirculant, ...
Ključne besede: symmetric graph, semiregular, tricirculant
Objavljeno: 15.10.2013; Ogledov: 1510; Prenosov: 17
URL Polno besedilo (0,00 KB)

2.
A complete classification of cubic symmetric graphs of girth 6
Klavdija Kutnar, Dragan Marušič, 2009, izvirni znanstveni članek

Opis: A complete classification of cubic symmetric graphs of girth 6 is given. It is shown that with the exception of the Heawood graph, the Moebius-Kantor graph, the Pappus graph, and the Desargues graph, a cubic symmetric graph ▫$X$▫ of girth 6 is a normal Cayley graph of a generalized dihedral group; in particular, (i) ▫$X$▫ is 2-regular if and only if it is isomorphic to a so-called ▫$I_k^n$▫-path, a graph of order either ▫$n^2/2$▫ or ▫$n^2/6$▫, which is characterized by the fact that its quotient relative to a certain semiregular automorphism is a path. (ii) ▫$X$▫ is 1-regular if and only if there exists an integer ▫$r$▫ with prime decomposition ▫$r=3^s p_1^{e_1} \dots p_t^{e_t} > 3$▫, where ▫$s \in \{0,1\}$▫, ▫$t \ge 1$▫, and ▫$p_i \equiv 1 \pmod{3}$▫, such that ▫$X$▫ is isomorphic either to a Cayley graph of a dihedral group ▫$D_{2r}$▫ of order ▫$2r$▫ or ▫$X$▫ is isomorphic to a certain ▫$\ZZ_r$▫-cover of one of the following graphs: the cube ▫$Q_3$▫, the Pappus graph or an ▫$I_k^n(t)$▫-path of order ▫$n^2/2$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...A complete classification of cubic symmetric graphs of girth 6 is given. It is...
Ključne besede: graph theory, cubic graphs, symmetric graphs, ▫$s$▫-regular graphs, girth, consistent cycle
Objavljeno: 15.10.2013; Ogledov: 1737; Prenosov: 33
URL Polno besedilo (0,00 KB)

3.
On 2-fold covers of graphs
Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: A regular covering projection ▫$\wp : \widetilde{X} \to X$▫ of connected graphs is ▫$G$▫-admissible if ▫$G$▫ lifts along ▫$\wp$▫. Denote by ▫$\tilde{G}$▫ the lifted group, and let CT▫$(\wp)$▫ be the group of covering transformations. The projection is called ▫$G$▫-split whenever the extension ▫{$\mathrm{CT}}(\wp) \to \tilde{G} \to G$▫ splits. In this paper, split 2-covers are considered, with a particular emphasis given to cubic symmetric graphs. Supposing that ▫$G$▫ is transitive on ▫$X$▫, a ▫$G$▫-split cover is said to be ▫$G$▫-split-transitive if all complements ▫$\tilde{G} \cong G$▫ of CT▫$(\wp)$▫ within ▫$\tilde{G}$▫ are transitive on ▫$\widetilde{X}$▫; it is said to be ▫$G$▫-split-sectional whenever for each complement ▫$\tilde{G}$▫ there exists a ▫$\tilde{G}$▫-invariant section of ▫$\wp$▫; and it is called ▫$G$▫-split-mixed otherwise. It is shown, when ▫$G$▫ is an arc-transitive group, split-sectional and split-mixed 2-covers lead to canonical double covers. Split-transitive covers, however, are considerably more difficult to analyze. For cubic symmetric graphs split 2-cover are necessarily canonical double covers (that is, no ▫$G$▫-split-transitive 2-covers exist) when ▫$G$▫ is 1-regular or 4-regular. In all other cases, that is, if ▫$G$▫ is ▫$s$▫-regular, ▫$s=2,3$▫ or ▫$5$▫, a necessary and sufficient condition for the existence of a transitive complement ▫$\tilde{G}$▫ is given, and moreover, an infinite family of split-transitive 2-covers based on the alternating groups of the form ▫$A_{12k+10}$▫ is constructed. Finally, chains of consecutive 2-covers, along which an arc-transitive group ▫$G$▫ has successive lifts, are also considered. It is proved that in such a chain, at most two projections can be split. Further, it is shown that, in the context of cubic symmetric graphs, if exactly two of them are split, then one is split-transitive and the other one is either split-sectional or split-mixed.
Najdeno v: ključnih besedah
Povzetek najdenega: ...with a particular emphasis given to cubic symmetric graphs. Supposing that ▫$G$▫ is transitive on...
Ključne besede: graph theory, graphs, cubic graphs, symmetric graphs, ▫$s$▫-regular group, regular covering projection
Objavljeno: 15.10.2013; Ogledov: 1169; Prenosov: 13
URL Polno besedilo (0,00 KB)

4.
Adjacency preservers, symmetric matrices, and cores
Marko Orel, 2012, izvirni znanstveni članek

Opis: It is shown that the graph ▫$\Gamma_n$▫ that has the set of all ▫$n \times n$▫ symmetric matrices over a finite field as the vertex set, with two matrices being adjacent if and only if the rank of their difference equals one, is a core if ▫$n \ge 3$▫. Eigenvalues of the graph ▫$\Gamma_n$▫ are calculated as well.
Najdeno v: ključnih besedah
Povzetek najdenega: ...It is shown that the graph ▫$\Gamma_n$▫ that has the set of all...
Ključne besede: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic form
Objavljeno: 15.10.2013; Ogledov: 1367; Prenosov: 53
URL Polno besedilo (0,00 KB)

5.
Classification of cubic symmetric tetracirculants and pentacirculants
Boštjan Frelih, Klavdija Kutnar, 2013, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculant, ...
Ključne besede: cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculant
Objavljeno: 15.10.2013; Ogledov: 1258; Prenosov: 35
URL Polno besedilo (0,00 KB)

6.
Cubic symmetric graphs via odd automorphisms, 60th Birthday Lecture Series, Department of Mathematics, University of Auckland, New Zealand, 10 September 2015
Klavdija Kutnar, 2015, predavanje na tuji univerzi

Najdeno v: ključnih besedah
Povzetek najdenega: ...cubic graph, symmetric, automorphism, odd permutation, ...
Ključne besede: cubic graph, symmetric, automorphism, odd permutation
Objavljeno: 15.10.2015; Ogledov: 1014; Prenosov: 10
URL Polno besedilo (0,00 KB)

7.
On generalizations of the Petersen graph and the Coxeter graph
Marko Orel, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...matrike, Coexter graph, Petersen graph, Hermitian matrix, symmetric matrix, ...
Ključne besede: Petersenov graf, Coexerjev graf, hermitske matrike, simetrične matrike, Coexter graph, Petersen graph, Hermitian matrix, symmetric matrix
Objavljeno: 03.04.2017; Ogledov: 617; Prenosov: 27
URL Polno besedilo (0,00 KB)

8.
Graphs with large minimal vertex-transitive automorphism groups
Robert Jajcay, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Povzetek najdenega: ...vertex-transitive graph, automorphism group, symmetric graph...
Ključne besede: vertex-transitive graph, automorphism group, symmetric graph
Objavljeno: 07.02.2018; Ogledov: 343; Prenosov: 12
URL Polno besedilo (0,00 KB)

9.
Odd extensions of transitive groups via symmetric graphs - The cubic case
Klavdija Kutnar, Dragan Marušič, 2018, izvirni znanstveni članek

Opis: When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that the existence of automorphisms acting as even permutations on the vertex set of a graph, called even automorphisms, forces the existence of automorphisms that act as odd permutations, called odd automorphisms. As a first step towards resolving the above question, complete information on the existence of odd automorphisms in cubic symmetric graphs is given.
Najdeno v: ključnih besedah
Povzetek najdenega: ...permutations on the vertex set of a graph, called even automorphisms, forces the existence of...
Ključne besede: automorphism group, arc-transitive, even permutation, odd permutation, cubic symmetric graph
Objavljeno: 19.11.2018; Ogledov: 200; Prenosov: 51
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