# 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

 81 - 90 / 198 567891011121314 81.Minimal normal subgroups of transitive permutation groups of square-free degreeAleksander Malnič, Dragan Marušič, Edward Dobson, Lewis A. Nowitz, 2007, original scientific articleAbstract: It is shown that a minimal normal subgroup of a transitive permutation group of square-free degree in its induced action is simple and quasiprimitive, with three exceptions related to ▫$A_5$▫, ▫$A_7$▫, and PSL(2,29). Moreover, it is shown that a minimal normal subgroup of a 2-closed permutation group of square-free degree in its induced action is simple. As an almost immediate consequence, it follows that a 2-closed transitive permutation group of square-free degree contains a semiregular element of prime order, thus giving a partial affirmative answer to the conjecture that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs,Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the fifteenth British combinatorial conference, Discrete Math. 167/168 (1997) 605-615]).Found in: ključnih besedahSummary of found: ...mathematics, graph theory, transitive permutation group, 2-closed group, square-free...Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graphPublished: 03.04.2017; Views: 991; Downloads: 57 Full text (0,00 KB) 82.Symmetry structure of bicirculantsBoštjan Frelih, Primož Šparl, Aleksander Malnič, Dragan Marušič, 2007, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...An ▫$n$▫-bicirculant is a graph having an automorphism with two orbits of...Keywords: mathematics, graph theory, graph, circulant, bicirculant, automorphism groupPublished: 03.04.2017; Views: 1121; Downloads: 61 Full text (0,00 KB) 83.On strongly regular bicirculantsDragan Marušič, Aleksander Malnič, Primož Šparl, 2007, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...An ▫$n$▫-bicirculantis a graph having an automorphism with two orbits of...Keywords: mathematics, graph theory, graph, circulant, bicirculant, automorphism groupPublished: 03.04.2017; Views: 1241; Downloads: 56 Full text (0,00 KB) 84.Semiregular automorphisms of vertex-transitive graphs of certain valenciesDragan Marušič, Edward Dobson, Aleksander Malnič, Lewis A. Nowitz, 2007, original scientific articleAbstract: It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive action of a ▫$\{2,p\}$▫-group, has a non-identity semiregular automorphism. As a consequence, it is proved that a quartic vertex-transitive graph has a non-identity semiregular automorphism, thus giving a partial affirmative answer to the conjecture that all vertex-transitive graphs have such an automorphism and, more generally, that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs, Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the Fifteenth British Combinatorial Conference, Discrete Math. 167/168 (1997) 605-615]).Found in: ključnih besedahSummary of found: ...It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting...Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, semiregular automorphism, vertex-transitive graphPublished: 03.04.2017; Views: 990; Downloads: 51 Full text (0,00 KB) 85.Semisymmetric elementary abelian covers of the Möbius-Kantor graphAleksander Malnič, Štefko Miklavič, Primož Potočnik, Dragan Marušič, 2007, original scientific articleAbstract: Let ▫$\wp_N : \tilde{X} \to X$▫ be a regular covering projection of connected graphs with the group of covering transformations isomorphic to ▫$N$▫. If ▫$N$▫ is an elementary abelian ▫$p$▫-group, then the projection ▫$\wp_N$▫ is called ▫$p$▫-elementary abelian. The projection ▫$\wp_N$▫ is vertex-transitive (edge-transitive) if some vertex-transitive (edge-transitive) subgroup of Aut ▫$X$▫ lifts along ▫$\wp_N$▫, and semisymmetric if it is edge- but not vertex-transitive. The projection ▫$\wp_N$▫ is minimal semisymmetric if ▫$\wp_N$▫ cannot be written as a composition ▫$\wp_N = \wp \circ \wp_M$▫ of two (nontrivial) regular covering projections, where ▫$\pw_M$▫ is semisymmetric. Finding elementary abelian covering projections can be grasped combinatorially via a linear representation of automorphisms acting on the first homology group of the graph. The method essentially reduces to finding invariant subspaces of matrix groups over prime fields (see [A. Malnic, D. Marušic, P. Potocnik, Elementary abelian covers of graphs, J. Algebraic Combin. 20 (2004) 71-97]). In this paper, all pairwise nonisomorphic minimal semisymmetric elementary abelian regular covering projections of the Möbius-Kantor graph, the Generalized Petersen graph GP(8,3), are constructed. No such covers exist for ▫$p=2$▫. Otherwise, the number of such covering projections is equal to ▫$(p-1)/4$▫ and ▫$1+(p-1)/4$▫ in cases ▫$p \equiv 5,9,13,17,21 \pmod{24}$▫ and ▫$p \equiv 1 \pmod{24}$▫, respectively, and to ▫$(p+1)/4$▫ and ▫$1+(p+1)/4$▫ in cases ▫$p \equiv 3,7,11,15,23 \pmod{24}$▫ and ▫$p \equiv 19 \pmod{24}$▫, respectively. For each such covering projection the voltage rules generating the corresponding covers are displayed explicitly.Found in: ključnih besedahKeywords: mathematics, graph theory, graph, covering projection, lifting automorphisms, homology group, group representation, matrix group, invariant subspacesPublished: 03.04.2017; Views: 891; Downloads: 55 Full text (0,00 KB) 86.Additive rank-one nonincreasing maps on Hermitian matrices over the field GF(2[sup]2)Marko Orel, Bojan Kuzma, 2009, original scientific articleAbstract: A complete classification of additive rank-one nonincreasing maps on hermitian matrices over Galois field ▫$GF(2^2)$▫ is obtained. This field is special and was not covered in a previous paper. As a consequence, some known applications, like the classification of additive rank-additivity preserving maps, are extended to arbitrary fields. An application concerning the preservers of hermitian varieties is also presented.Found in: ključnih besedahKeywords: mathematics, linear algebra, additive preserver, hermitian matrices, rank, Galois field, weak homomorphism of a graphPublished: 03.04.2017; Views: 978; Downloads: 31 Full text (0,00 KB)This document has more files! More... 87.On maximal distances in a commuting graphBojan Kuzma, Polona Oblak, Gregor Dolinar, 2012, original scientific articleAbstract: It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.Found in: ključnih besedahKeywords: matematika, linearna algebra, teorija grafov, komutirajoči grafi, matrična algebra, algebraično zaprt obseg, centralizator, razdalja v grafih, mathematics, linear algebra, graph theory, commuting graph, matrix algebra, algebraically closed field, centralizer, distance in graphsPublished: 03.04.2017; Views: 852; Downloads: 129 Full text (0,00 KB)This document has more files! More... 88.On generalizations of the Petersen graph and the Coxeter graphMarko Orel, 2015, original scientific articleFound in: ključnih besedahKeywords: Petersenov graf, Coexerjev graf, hermitske matrike, simetrične matrike, Coexter graph, Petersen graph, Hermitian matrix, symmetric matrixPublished: 03.04.2017; Views: 829; Downloads: 40 Full text (0,00 KB) 89.Generalized cagesRobert Jajcay, Marko Boben, Tomaž Pisanski, 2015, original scientific articleFound in: ključnih besedahSummary of found: ...cage, graph, isomorphism, ...Keywords: cage, graph, isomorphismPublished: 03.04.2017; Views: 737; Downloads: 26 Full text (0,00 KB) 90.Groups that are transitive on all partitions of a given shapeEdward Dobson, Aleksander Malnič, 2015, original scientific articleFound in: ključnih besedahSummary of found: ...transitive group, ordered partition, unordered partition, Johnson graph, Cayley graph, ...Keywords: transitive group, ordered partition, unordered partition, Johnson graph, Cayley graphPublished: 03.04.2017; Views: 948; Downloads: 104 Full text (0,00 KB)
Search done in 0 sec.
{"ft_lang_label":"__label__en","ft_lang_prob":0.77327013,"math_prob":0.72532153,"size":9919,"snap":"2020-24-2020-29","text_gpt3_token_len":2872,"char_repetition_ratio":0.11638931,"word_repetition_ratio":0.20344053,"special_character_ratio":0.2439762,"punctuation_ratio":0.21750663,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9507365,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-05-27T12:06:14Z\",\"WARC-Record-ID\":\"<urn:uuid:4f0d97b4-42d5-4e37-acbd-5e1218e3ce72>\",\"Content-Length\":\"43507\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:26b51521-5b43-41ae-93d3-13359e7df60c>\",\"WARC-Concurrent-To\":\"<urn:uuid:adad3abf-a50b-4fd6-b30d-df67bc6c13b9>\",\"WARC-IP-Address\":\"212.235.226.95\",\"WARC-Target-URI\":\"http://repozitorij.upr.si/Iskanje.php?type=napredno&lang=eng&stl0=KljucneBesede&niz0=K4-minor-free+graph&page=9\",\"WARC-Payload-Digest\":\"sha1:M3MORNQZTMS3BDHV74JTJBYEPJ6REJZL\",\"WARC-Block-Digest\":\"sha1:VYLNPRFJWIKJSBDIWUM274MMFFD4D5AW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347394074.44_warc_CC-MAIN-20200527110649-20200527140649-00299.warc.gz\"}"}