Processing math: 54%
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 / 281
Na začetekNa prejšnjo stran12345678910Na naslednjo stranNa konec
1.
Cyclic m-DCI-groups and m-CI-groups
István Kovács, Luka Šinkovec, 2025, izvirni znanstveni članek

Opis: Based on the earlier work of Li from 1997 and Dobson from 2008, in this paper we complete the classification of cyclic m-DCI-groups and m-CI-groups. For a positive integer m such that m ≥ 3, we show that the group ℤ_(n) is an m-DCI-group if and only if n is not divisible by 8 nor by p² for any odd prime p < m. Furthermore, if m ≥ 6, then we show that ℤn is an m-CI-group if and only if either n ∈ {8, 9, 18}, or n ∉ {8, 9, 18} and n is not divisible by 8 nor by p² for any odd prime p < (m - 1)/2.
Ključne besede: Cayley graph, cyclic group, m-CI-group, m-DCI-group
Objavljeno v RUP: 01.04.2025; Ogledov: 97; Prenosov: 5
.pdf Celotno besedilo (446,08 KB)
Gradivo ima več datotek! Več...

2.
3.
4.
The core of a vertex-transitive complementary prism
Marko Orel, 2023, izvirni znanstveni članek

Opis: The complementary prism Γ¯Γ is obtained from the union of a graph Γ and its complement ¯Γ where each pair of identical vertices in Γ and ¯Γ is joined by an edge. It generalizes the Petersen graph, which is the complementary prism of the pentagon. The core of a vertex-transitive complementary prism is studied. In particular, it is shown that a vertex-transitive complementary prism Γ¯Γ is a core, i.e. all its endomorphisms are automorphisms, whenever Γ is a core or its core is a complete graph.
Ključne besede: graph homomorphism, complementary prism, self-complementary graph, vertex-transitive graph, core
Objavljeno v RUP: 06.11.2023; Ogledov: 1428; Prenosov: 6
.pdf Celotno besedilo (305,54 KB)

5.
On girth-biregular graphs
György Kiss, Štefko Miklavič, Tamás Szőnyi, 2023, izvirni znanstveni članek

Ključne besede: girth cycle, girth-biregular graph, steiner system, generalized polygons
Objavljeno v RUP: 06.11.2023; Ogledov: 907; Prenosov: 4
.pdf Celotno besedilo (429,83 KB)

6.
The Sierpiński product of graphs
Jurij Kovič, Tomaž Pisanski, Sara Sabrina Zemljič, Arjana Žitnik, 2023, izvirni znanstveni članek

Opis: In this paper we introduce a product-like operation that generalizes the construction of the generalized Sierpiński graphs. Let G,H be graphs and let f:V(G)V(H) be a function. Then the Sierpiński product of graphs G and H with respect to f, denoted by GfH, is defined as the graph on the vertex set V(G)×V(H), consisting of |V(G)| copies of H; for every edge {g,g} of G▫$ there is an edge between copies ▫$gH and g'H of form \{(g, f(g'), (g', f(g))\}. Some basic properties of the Sierpiński product are presented. In particular, we show that the graph G\otimes_f H is connected if and only if both graphs G and H are connected and we present some conditions that G, \, H must fulfill for G\otimes_f H to be planar. As for symmetry properties, we show which automorphisms of G and H extend to automorphisms of G\otimes_f H. In several cases we can also describe the whole automorphism group of the graph G\otimes_f H. Finally, we show how to extend the Sierpiński product to multiple factors in a natural way. By applying this operation n times to the same graph we obtain an alternative approach to the well-known n-th generalized Sierpiński graph.
Ključne besede: Sierpiński graphs, graph products, connectivity, planarity, symmetry
Objavljeno v RUP: 06.11.2023; Ogledov: 999; Prenosov: 4
.pdf Celotno besedilo (526,44 KB)

7.
8.
9.
Analiza blagovnih trgov : pristop teorije grafov
Luka Pavlović, 2023, magistrsko delo

Ključne besede: graph, minimum spanning tree, strenght, betwenness, distance, commodites
Objavljeno v RUP: 25.08.2023; Ogledov: 1297; Prenosov: 9
.pdf Celotno besedilo (1,20 MB)

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