Lupa

Search the repository Help

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

Options:
  Reset


71 - 80 / 144
First pagePrevious page45678910111213Next pageLast page
71.
72.
Odd automorphisms in vertex-transitive graphs
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, original scientific article

Abstract: An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained.
Keywords: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Published in RUP: 15.11.2017; Views: 2177; Downloads: 100
.pdf Full text (281,25 KB)

73.
Vertex-transitive odd numbers
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2017, published scientific conference contribution abstract (invited lecture)

Keywords: odd automorphism, even-closed, vertex-transitive, graph
Published in RUP: 15.11.2017; Views: 1650; Downloads: 22
URL Link to full text

74.
Vertex-transitive odd numbers
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2017, published scientific conference contribution abstract (invited lecture)

Keywords: odd automorphism, even-closed, vertex-transitive, graph
Published in RUP: 15.11.2017; Views: 1711; Downloads: 25
URL Link to full text

75.
76.
77.
Wienerjev indeks in sorodne invarante grafov : magistrsko delo
Sabina Prodanovič, 2012, master's thesis

Published in RUP: 13.11.2017; Views: 1663; Downloads: 42
URL Link to full text

78.
79.
On cyclic edge-connectivity of fullerenes
Klavdija Kutnar, Dragan Marušič, 2008, original scientific article

Abstract: A graph is said to be cyclically ▫$k$▫-edge-connected, if at least ▫$k$▫ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of ▫$k$▫ edges is called a cyclic-k-edge cutset and it is called a trivial cyclic-k-edge cutset if at least one of the resulting two components induces a single ▫$k$▫-cycle. It is known that fullerenes, that is, 3-connected cubic planar graphs all of whose faces are pentagons and hexagons, are cyclically 5-edge-connected. In this article it is shown that a fullerene ▫$F$▫ containing a nontrivial cyclic-5-edge cutset admits two antipodal pentacaps, that is, two antipodal pentagonal faces whose neighboring faces are also pentagonal. Moreover, it is shown that ▫$F$▫ has a Hamilton cycle, and as a consequence at least ▫$15 \cdot 2^{n/20-1/2}$▫ perfect matchings, where ▫$n$▫ is the order of ▫$F$▫.
Keywords: graph, fullerene graph, cyclic edge-connectivity, hamilton cycle, perfect matching
Published in RUP: 03.04.2017; Views: 2042; Downloads: 138
URL Link to full text

80.
Analiza nakupnega vedenja potrošnikov na primeru izbranega podjetja : zaključna projektna naloga
Klavdija Vodenik, 2015, undergraduate thesis

Keywords: organizacije, management, potropniki, vedenje, dejavniki, nakupi, vpliv
Published in RUP: 10.11.2016; Views: 2189; Downloads: 138
URL Link to full text
This document has more files! More...

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