Št. zadetkov: 46
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake:
krovne projekcije;grafi;rešljive grupe;covering projections;graphs;solvable groups;
Generating solvable covers
Leto:
2015
Vir:
Univerza na Primorskem (UP)
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake:
krovne projekcije;grafi;rešljive grupe;covering projections;graphs;solvable groups;
Computational aspects of graph coverings
Leto:
2014
Vir:
Univerza na Primorskem (UP)
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake:
covering projection;graph;lifting automorphsim;
Computational aspects of lifting automorphisms
Leto:
2015
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
algorith;epimorphism;finitely presented group;regular covering projection;quotient group;
Leto:
2019
Vir:
Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake:
covering projection;graph;group extension;lifting automorphisms;voltage assignment;
Covering techniques have recently emerged as an effective tool used for classification of several infinite families of connected symmetric graphs. One commonly encountered technique is based on the concept of lifting groups of automorphisms along regular covering projections ▫$\wp \colon \tilde{X} \ ...
Leto:
2013
Vir:
Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake:
algorithm;graph;group extension;lifting automorphisms;regular covering projection;voltages;
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 whethe ...
Leto:
2016
Vir:
Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake:
algorithm;Cayley voltages;covering projection;graph;group presentation;invariant section;lifting automorphisms;linear systems over the integers;split extension;
Let ▫$ p\colon \tilde {X} \rightarrow X$▫ be a regular covering projection of connected graphs, where ▫$ {\mathrm{CT}}_{\mathcal P}$▫ denotes the group of covering transformations. Suppose that a group ▫$ G \leq \mathrm{Aut} \,X$▫ lifts along ▫$\mathcal P$▫ to a group ▫$ \tilde {G} \leq \mathrm{Aut} ...
Leto:
2019
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
algorithm;abelian cover;Cayley voltages;covering projection;graph;group extension;group presentation;lifting automorphisms;linear systems over the integers;semidirect product;
Naj bo ▫$\wp \colon \tilde{X} \to X$▫ regularna krovna projekcija povezanih grafov, grupa krovnih transformacij ▫$\rm{CT}_\wp$▫ pa naj bo abelova. Ob predpostavki, da se grupa avtomorfizmov ▫$G \le \rm{Aut} X$▫ dvigne vzdolž ▫$\wp$▫ do grupe ▫$\tilde{G} \le \rm{Aut} \tilde{X}$▫, podrobno analiziramo ...
Leto:
2016
Vir:
Univerza na Primorskem (UP)
Izvirni znanstveni članek
Oznake:
algorithm;Hamilton walk;nonstandard metric;reduced walk;
A Hamilton walk in a finite graph is a walk, either open or closed, that traverses every vertex at least once. Here, we introduce Hamilton walks that are reduced in the sense that they avoid immediate backtracking: a reduced Hamilton walk never traverses the same edge forth and back consecutively. W ...
Leto:
2026
Vir:
Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Izvirni znanstveni članek
Oznake:
algoritem;hamiltonski sprehod;nestandardna metrika;reduciran sprehod;algorithm;Hamilton walk;nonstandard metric;reduced walk;
A Hamilton walk in a finite graph is a walk, either open or closed, that traverses every vertex at least once. Here, we introduce Hamilton walks that are reduced in the sense that they avoid immediate backtracking: a reduced Hamilton walk never traverses the same edge forth and back consecutively. W ...
Leto:
2026
Vir:
Repozitorij Univerze v Ljubljani (RUL)