# 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

 1 - 10 / 101 1.Classification of cubic symmetric tricirculantsIstván Kovács, Klavdija Kutnar, Dragan Marušič, Stephen Wilson, 2012, original scientific articleFound in: ključnih besedahSummary of found: ...symmetric graph, semiregular, tricirculant, ...Keywords: symmetric graph, semiregular, tricirculantPublished: 15.10.2013; Views: 1621; Downloads: 25 Full text (0,00 KB) 2.A complete classification of cubic symmetric graphs of girth 6Klavdija Kutnar, Dragan Marušič, 2009, original scientific articleAbstract: 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$▫.Found in: ključnih besedahSummary of found: ...A complete classification of cubic symmetric graphs of girth 6 is given. It is...Keywords: graph theory, cubic graphs, symmetric graphs, ▫$s$▫-regular graphs, girth, consistent cyclePublished: 15.10.2013; Views: 1849; Downloads: 52 Full text (0,00 KB) 3.On 2-fold covers of graphsYan-Quan Feng, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2008, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...with a particular emphasis given to cubic symmetric graphs. Supposing that ▫$G$▫ is transitive on...Keywords: graph theory, graphs, cubic graphs, symmetric graphs, ▫$s$▫-regular group, regular covering projectionPublished: 15.10.2013; Views: 1325; Downloads: 14 Full text (0,00 KB) 4.Adjacency preservers, symmetric matrices, and coresMarko Orel, 2012, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...It is shown that the graph ▫$\Gamma_n$▫ that has the set of all...Keywords: adjacency preserver, symmetric matrix, finite field, eigenvalue of a graph, coloring, quadratic formPublished: 15.10.2013; Views: 1513; Downloads: 81 Full text (0,00 KB) 5.Classification of cubic symmetric tetracirculants and pentacirculantsBoštjan Frelih, Klavdija Kutnar, 2013, original scientific articleFound in: ključnih besedahSummary of found: ...cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculant, ...Keywords: cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculantPublished: 15.10.2013; Views: 1436; Downloads: 52 Full text (0,00 KB) 6.Cubic symmetric graphs via odd automorphisms, 60th Birthday Lecture Series, Department of Mathematics, University of Auckland, New Zealand, 10 September 2015Klavdija Kutnar, 2015, invited lecture at foreign universityFound in: ključnih besedahSummary of found: ...cubic graph, symmetric, automorphism, odd permutation, ...Keywords: cubic graph, symmetric, automorphism, odd permutationPublished: 15.10.2015; Views: 1087; Downloads: 10 Full text (0,00 KB) 7.On generalizations of the Petersen graph and the Coxeter graphMarko Orel, 2015, original scientific articleFound in: ključnih besedahSummary of found: ...matrike, Coexter graph, Petersen graph, Hermitian matrix, symmetric matrix, ...Keywords: Petersenov graf, Coexerjev graf, hermitske matrike, simetrične matrike, Coexter graph, Petersen graph, Hermitian matrix, symmetric matrixPublished: 03.04.2017; Views: 742; Downloads: 33 Full text (0,00 KB) 8.Graphs with large minimal vertex-transitive automorphism groupsRobert Jajcay, 2018, published scientific conference contribution abstract (invited lecture)Found in: ključnih besedahSummary of found: ...vertex-transitive graph, automorphism group, symmetric graph...Keywords: vertex-transitive graph, automorphism group, symmetric graphPublished: 07.02.2018; Views: 446; Downloads: 13 Full text (0,00 KB) 9.Odd extensions of transitive groups via symmetric graphs - The cubic caseKlavdija Kutnar, Dragan Marušič, 2018, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...permutations on the vertex set of a graph, called even automorphisms, forces the existence of...Keywords: automorphism group, arc-transitive, even permutation, odd permutation, cubic symmetric graphPublished: 19.11.2018; Views: 320; Downloads: 83 Full text (0,00 KB) 10.On cubic symmetric non-Cayley graphs with solvable automorphism groupsYan-Quan Feng, Klavdija Kutnar, Dragan Marušič, Da-Wei Yang, 2019, original scientific articleFound in: ključnih besedahSummary of found: ...symmetric graph, non-Cayley graph, regular cover...Keywords: symmetric graph, non-Cayley graph, regular coverPublished: 18.11.2019; Views: 299; Downloads: 18 Full text (0,00 KB)
Search done in 0 sec.