Print
Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 57
First pagePrevious page123456Next pageLast page
1.
Regular polygonal systems
Jurij Kovič, 2019, original scientific article

Keywords: regular polygonal system, boundary code, face vector, symmetry group, reconstructibility from the boundary
Published in RUP: 03.01.2022; Views: 776; Downloads: 17
.pdf Full text (353,82 KB)

2.
Testing whether the lifted group splits
Rok Požar, 2016, original scientific article

Abstract: Let a group of automorphisms lift along a regular covering projection of connected graphs given combinatorially by means of voltages. The data that determine the lifted group and its action are then conveniently encoded in terms of voltages as well. Along these lines, an algorithm for testing whether the lifted group is a split extension of the group of covering transformations has recently been proposed in the case when the group of covering transformations is solvable. It consists of decomposing the covering into a series of coverings with elementary abelian groups of covering transformations, and inductively solving the problem at every elementary abelian step. Although the explicit construction of the lifted group is not needed, it still involves time and space consuming constructions of certain subgroups in the lifted group at every step except at the final one. In this paper, an improved version that completely avoids such constructions is presented. From voltage distribution we first compute the weak action and the factor set that determine the lifted group, and we then carry out the test by extracting the necessary information only from the corresponding weak actions and factor sets at every step. An experimental comparison is made against the previous version.
Keywords: algorithm, graph, group extension, lifting automorphisms, regular covering projection, voltages
Published in RUP: 03.01.2022; Views: 707; Downloads: 17
.pdf Full text (317,95 KB)

3.
Extremal edge-girth-regular graphs
Ajda Zavrtanik Drglin, Slobodan Filipovski, Robert Jajcay, Tom Raiman, 2021, original scientific article

Keywords: regular graph, girth, vertex-transitive graph
Published in RUP: 16.07.2021; Views: 979; Downloads: 27
URL Link to full text

4.
On 12-regular nut graphs
Nino Bašić, Martin Knor, Riste Škrekovski, 2021, original scientific article

Keywords: nut graph, adjacency matrix, singular matrix, core graph, Fowler construction, regular graph
Published in RUP: 16.07.2021; Views: 989; Downloads: 24
URL Link to full text

5.
6.
Existence of regular nut graphs for degree at most 11
Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaž Pisanski, Irene Sciriha, 2020, original scientific article

Keywords: nut graph, core graph, regular graph, nullity
Published in RUP: 06.05.2021; Views: 762; Downloads: 0

7.
Regular Cayley maps for dihedral groups
István Kovács, Young Soo Kwon, 2021, original scientific article

Keywords: regular map, Cayley map, dihedral group
Published in RUP: 18.01.2021; Views: 963; Downloads: 33
URL Link to full text

8.
9.
On a version of the spectral excess theorem
Miquel Àngel Fiol, Safet Penjić, 2020, original scientific article

Keywords: adjacency algebra, spectrum, distance-regular graph, Laplacian
Published in RUP: 02.12.2020; Views: 1618; Downloads: 35
URL Link to full text

10.
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica