Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 6
Doktorska disertacija
Oznake: cubic graph;vertex-transitive graph;voltage graph;graph cover;multicirculant;polycirculant;cyclic group;
Leto: 2020 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Izvirni znanstveni članek
Oznake: graph;cubic;semiregular automorphism;tricirculant;vertex-transitive;
Leto: 2020 Vir: Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake: cubic vertex-transitive graphs;multicirculants;automorphisms of large order;
A connected graph of order ▫$n$▫ admitting a semiregular automorphism of order ▫$n/k$▫ is called a ▫$k$▫-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for cubic vertex- and arc-transitive multicirculants. In ...
Leto: 2023 Vir: Digitalni repozitorij raziskovalnih organizacij Slovenije
Izvirni znanstveni članek
Oznake: maniplex;polytope;faithful;thin;regular cover;
Maniplexes are coloured graphs that generalise maps on surfaces and abstract polytopes. Each maniplex uniquely defines a partially ordered set that encodes information about its structure. When this poset is an abstract polytope, we say that the associated maniplex is polytopal. Maniplexes that have ...
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake: graphs;automorphism groups;vertex-transitive;regular orbit;cubic;tetravalent;
In this paper we investigate orders, longest cycles and the number of cycles of automorphisms of finite vertex-transitive graphs. In particular, we show that the order of every automorphism of a connected vertex-transitive graph with ▫$n$▫ vertices and of valence ▫$d$▫, ▫$d\le 4$▫, is at most ▫$c_d ...
Leto: 2024 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Izvirni znanstveni članek
Oznake: cornerations;maps;vertex-transitive group of automorphisms;
A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize the notion of a cycle structure in a symmetric graph. In thi ...
Leto: 2025 Vir: Repozitorij Univerze v Ljubljani (RUL)
Št. zadetkov: 6
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: