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 / 83
Na začetekNa prejšnjo stran123456789Na naslednjo stranNa konec
1.
Group distance magic cubic graphs
Sylwia Cichacz, Štefko Miklavič, 2026, izvirni znanstveni članek

Opis: A $\Gamma$-distance magic labeling of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in N(x)}\ell(y)$ of every vertex $x \in V$ is equal to $\mu$. In this case, the element $\mu$ is called the magic constant of $G$. A graph $G$ is called a group distance magic if there exists a $\Gamma$-distance magic labeling of $G$ for every Abelian group $\Gamma$ of order $n$. In this paper, we focused on cubic $\Gamma$-distance magic graphs as well as some properties of such graphs.
Ključne besede: group distance magic labeling, Kotzig array, generalized Petersen graph
Objavljeno v RUP: 06.05.2026; Ogledov: 437; Prenosov: 6
.pdf Celotno besedilo (187,65 KB)
Gradivo ima več datotek! Več...

2.
Nut graphs with a given automorphism group
Nino Bašić, Patrick W. Fowler, 2025, izvirni znanstveni članek

Opis: A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all nonzero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group can be represented as the group of automorphisms of infinitely many nut graphs. It is further shown that such nut graphs exist even within the class of regular graphs; the cases where the degree is 8, 12, 16, 20 or 24 are realised explicitly.
Ključne besede: nut graph, graph automorphism, automorphism group, nullity, graph spectra, f-universal
Objavljeno v RUP: 25.11.2025; Ogledov: 1054; Prenosov: 4
.pdf Celotno besedilo (526,71 KB)
Gradivo ima več datotek! Več...

3.
A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
J. Pascal Gollin, Kevin Hendrey, O-joung Kwon, Sang-il Oum, Youngho Yoo, 2025, izvirni znanstveni članek

Opis: In 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter and Neumann-Lara asked in 1988 to find all pairs (l, z) of integers where such a duality holds for the family of cycles of length l modulo z. We characterise all such pairs, and we further generalise this characterisation to cycles in graphs labelled with a bounded number of abelian groups, whose values avoid a bounded number of elements of each group. This unifies almost all known types of cycles that admit such a duality, and it also provides new results. Moreover, we characterise the obstructions to such a duality in this setting, and thereby obtain an analogous characterisation for cycles in graphs embeddable on a fixed compact orientable surface.
Ključne besede: Erdős-Pósa property, cycle packing, group-labelled graph
Objavljeno v RUP: 17.11.2025; Ogledov: 890; Prenosov: 9
.pdf Celotno besedilo (1,17 MB)
Gradivo ima več datotek! Več...

4.
Transitive regular q-analogs of graphs
Dean Crnković, Vedrana Mikulić Crnković, Andrea Švob, Matea Zubović Žutolija, 2025, izvirni znanstveni članek

Opis: In 1976, Delsarte introduced the notion of q-analogs of designs, and q-analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by giving a method for constructing transitive regular q-analogs of graphs. Further, we illustrate the method by giving some examples. Additionally, we introduced the notion of q-analogs of quasi-strongly regular graphs and give examples of transitive q-analogs of quasi-strongly regular graphs coming from spreads.
Ključne besede: q-ary design, q-ary graph, regular graph, transitive group
Objavljeno v RUP: 03.11.2025; Ogledov: 667; Prenosov: 5
.pdf Celotno besedilo (382,29 KB)

5.
Minimal directed strongly regular Cayley graphs over generalized dicyclic groups
Yueli Han, Lu Lu, 2025, izvirni znanstveni članek

Opis: Let G be a group with identity element 1, and let S be a subset of G \ {1}. The subset S is called minimal if ⟨S⟩ = G and there exists an element s ∈ S such that ⟨S \ {s, s−1}⟩ ≠ G. In this paper, we completely determine all directed strongly regular Cayley graphs Cay(G, S) for any generalized dicyclic group G, provided that S is a minimal subset of G.
Ključne besede: directed strongly regular graph, Cayley graph, generalized dicyclic group
Objavljeno v RUP: 21.10.2025; Ogledov: 867; Prenosov: 9
.pdf Celotno besedilo (385,94 KB)

6.
Regular and semi-regular representations of groups by posets
Jonathan A. Barmak, 2025, izvirni znanstveni članek

Opis: By a result of Babai, with finitely many exceptions, every group G admits a semi-regular poset representation with three orbits, that is, a poset P with automorphism group Aut(P) ≃ G such that the action of Aut(P) on the underlying set is free and with three orbits. Among finite groups, only the trivial group and ℤ_2 have a regular poset representation (i.e. semi-regular with one orbit), however many infinite groups admit such a representation. In this paper we study non-necessarily finite groups which have a regular representation or a semi-regular representation with two orbits. We prove that if G admits a Cayley graph which is locally the Cayley graph of a free group, then it has a semi-regular representation of height 1 with two orbits. In this case we will see that any extension of the integers by G admits a regular representation. Applications are given to finite simple groups, hyperbolic groups, random groups and indicable groups.
Ključne besede: automorphism group of posets, Cayley graph, Dehn presentation, simple groups, random groups
Objavljeno v RUP: 21.10.2025; Ogledov: 835; Prenosov: 5
.pdf Celotno besedilo (431,19 KB)

7.
Notes on the diameter of the complement of the power graph of a finite group
Xuanlong Ma, Alireza Doostabadi, Kaishun Wang, 2025, izvirni znanstveni članek

Opis: We determine the diameter of every connected component of the complement of the power graph and the enhanced power graph of a finite group, which completely answers two questions by Peter J. Cameron.
Ključne besede: diameter, power graph, enhanced power graph, finite group
Objavljeno v RUP: 21.10.2025; Ogledov: 1001; Prenosov: 7
.pdf Celotno besedilo (316,31 KB)

8.
Stability of Cayley graphs and Schur rings
Ademir Hujdurović, István Kovács, 2025, izvirni znanstveni članek

Ključne besede: canonical double cover, Cayley graph, automorphism group, Schur ring
Objavljeno v RUP: 16.07.2025; Ogledov: 1138; Prenosov: 9
.pdf Celotno besedilo (416,67 KB)
Gradivo ima več datotek! Več...

9.
10.
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: 2028; Prenosov: 18
.pdf Celotno besedilo (446,08 KB)
Gradivo ima več datotek! Več...

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