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 - 7 / 7
First pagePrevious page1Next pageLast page
1.
The Sierpiński product of graphs
Jurij Kovič, Tomaž Pisanski, Sara Sabrina Zemljič, Arjana Žitnik, 2023, original scientific article

Abstract: 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) \to V(H)$▫ be a function. Then the Sierpiński product of graphs ▫$G$▫ and ▫$H$▫ with respect to ▫$f$▫, denoted by ▫$G\otimes_f H$▫, is defined as the graph on the vertex set ▫$V(G) \times 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.
Keywords: Sierpiński graphs, graph products, connectivity, planarity, symmetry
Published in RUP: 06.11.2023; Views: 327; Downloads: 3
.pdf Full text (526,44 KB)

2.
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: 850; Downloads: 17
.pdf Full text (353,82 KB)

3.
4.
Vertex-transitive graphs and their arc-types
Marston D. E. Conder, Tomaž Pisanski, Arjana Žitnik, 2017, original scientific article

Abstract: Let ▫$X$▫ be a finite vertex-transitive graph of valency ▫$d$▫, and let ▫$A$▫ be the full automorphism group of ▫$X$▫. Then the arc-type of ▫$X$▫ is defined in terms of the sizes of the orbits of the stabiliser ▫$A_v$▫ of a given vertex ▫$v$▫ on the set of arcs incident with ▫$v$▫. Such an orbit is said to be self-paired if it is contained in an orbit ▫$\Delta$▫ of ▫$A$▫ on the set of all arcs of v$X$▫ such that v$\Delta$▫ is closed under arc-reversal. The arc-type of ▫$X$▫ is then the partition of ▫$d$▫ as the sum ▫$n_1 + n_2 + \dots + n_t + (m_1 + m_1) + (m_2 + m_2) + \dots + (m_s + m_s)$▫, where ▫$n_1, n_2, \dots, n_t$▫ are the sizes of the self-paired orbits, and ▫$m_1,m_1, m_2,m_2, \dots, m_s,m_s$▫ are the sizes of the non-self-paired orbits, in descending order. In this paper, we find the arc-types of several families of graphs. Also we show that the arc-type of a Cartesian product of two "relatively prime" graphs is the natural sum of their arc-types. Then using these observations, we show that with the exception of ▫$1+1$▫ and ▫$(1+1)$▫, every partition as defined above is \emph{realisable}, in the sense that there exists at least one vertex-transitive graph with the given partition as its arc-type.
Keywords: symmetry type, vertex-transitive graph, arc-transitive graph, Cayley graph, cartesian product, covering graph
Published in RUP: 03.01.2022; Views: 844; Downloads: 18
.pdf Full text (475,17 KB)

5.
6.
Obvious and hidden symmetries of mathematical objects
Dragan Marušič, 2017, published scientific conference contribution abstract (invited lecture)

Keywords: mathematical object, symmetry, graph
Published in RUP: 15.11.2017; Views: 2673; Downloads: 80
URL Link to full text

7.
Bilateral synergies in foot force production tasks
Nejc Šarabon, Goran Marković, Pavle Mikulić, Mark L. Latash, 2013, original scientific article

Abstract: We analysed the effects of task symmetry during bilateral accurate force production tasks performed by the two feet. In particular, we tested a hypothesis that bilateral deficit would lead to higher indices of synergies defined as co-varied adjustments in the two forces across trials that reduced total force variability. The subjects produced steady-state force followed by a quick force pulse into the target. The two feet could be acting both into plantar flexion and into dorsiflexion (symmetrical tasks), or in opposite directions (asymmetrical task). We used the framework of the uncontrolled manifold hypothesis to quantify two variance components, one of which did not change total force (VUCM), while the other did (VORT). Synergy indices during the asymmetrical task were higher than in either symmetrical task. The difference was due to higher VUCM (compared to the symmetrical plantar flexion task) or lower VORT (compared to the symmetrical dorsiflexion task). The synergy index showed a drop (anticipatory synergy adjustment, ASA) starting 100150 ms prior to the force pulse initiation. The ASA tended to be shorter and of a smaller magnitude for the asymmetrical task. This is the first demonstration of bilateral synergies during accurate force production by the legs. We conclude that bilateral deficit has no or weak effects on two-leg synergies. The results fit the earlier introduced scheme with two groups of neural variables defining average performance of a redundant system and patterns of co-variation among its elemental variables, respectively
Keywords: kinesiology, force, synergy, legs, bilateral deficit, symmetry
Published in RUP: 15.10.2013; Views: 5462; Downloads: 241
URL Link to full text

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