Natisni
Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


71 - 80 / 144
Na začetekNa prejšnjo stran45678910111213Na naslednjo stranNa konec
71.
72.
Odd automorphisms in vertex-transitive graphs
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, izvirni znanstveni članek

Opis: 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.
Ključne besede: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Objavljeno v RUP: 15.11.2017; Ogledov: 2177; Prenosov: 100
.pdf Celotno besedilo (281,25 KB)

73.
Vertex-transitive odd numbers
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2017, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: odd automorphism, even-closed, vertex-transitive, graph
Objavljeno v RUP: 15.11.2017; Ogledov: 1650; Prenosov: 22
URL Povezava na celotno besedilo

74.
Vertex-transitive odd numbers
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2017, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: odd automorphism, even-closed, vertex-transitive, graph
Objavljeno v RUP: 15.11.2017; Ogledov: 1711; Prenosov: 25
URL Povezava na celotno besedilo

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

Objavljeno v RUP: 13.11.2017; Ogledov: 1661; Prenosov: 42
URL Povezava na celotno besedilo

78.
79.
On cyclic edge-connectivity of fullerenes
Klavdija Kutnar, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: 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$▫.
Ključne besede: graph, fullerene graph, cyclic edge-connectivity, hamilton cycle, perfect matching
Objavljeno v RUP: 03.04.2017; Ogledov: 2042; Prenosov: 138
URL Povezava na celotno besedilo

80.
Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici