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


1 - 10 / 13
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
Automorphism groups of wreath product digraphs
Edward Dobson, Joy Morris, 2009, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...wreath product digraph, automorphism group, ...
Ključne besede: wreath product digraph, automorphism group
Objavljeno: 15.10.2013; Ogledov: 2084; Prenosov: 6
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

2.
Some non-normal Cayley digraphs of the generalized quaternion group of certain orders
Edward Dobson, 2003, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...non-normal Cayley digraph, generalized quaternion group, ...
Ključne besede: non-normal Cayley digraph, generalized quaternion group
Objavljeno: 15.10.2013; Ogledov: 1843; Prenosov: 8
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

3.
On Hamiltonicity of circulant digraphs of outdegree three
Štefko Miklavič, Primož Šparl, 2009, izvirni znanstveni članek

Opis: This paper deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of the form ▫$\{a,ka,c\}$▫, where ▫$k$▫ is an integer. In particular, we prove that if ▫$k=-1$▫ or ▫$k=2$▫ such a circulant digraph is Hamiltonian if and only if it is not isomorphic to the circulant digraph on 12 vertices with connection set ▫$\{3,6,4\}$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of...
Ključne besede: graph theory, circulant digraph, Hamilton cycle
Objavljeno: 15.10.2013; Ogledov: 1263; Prenosov: 45
URL Polno besedilo (0,00 KB)

4.
Automorphism groups of Cayley digraphs of Zp3
Edward Dobson, István Kovács, 2009, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...Cayley digraph, automorphism group, ...
Ključne besede: Cayley digraph, automorphism group
Objavljeno: 15.10.2013; Ogledov: 2212; Prenosov: 8
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

5.
Reachability relations in digraphs
Norbert Seifter, Boris Zgrablić, Aleksander Malnič, Primož Šparl, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed in the direction opposite to their orientation. Then, a vertex ▫$u$▫ is ▫$R_k^+$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at u has weight in the interval ▫$[0,k]$▫. Similarly, a vertex ▫$u$▫ is ▫$R_k^-$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at ▫$u$▫ has weight in the interval ▫$[-k,0]$▫. For all positive integers ▫$k$▫, the relations ▫$R_k^+$▫ and ▫$R_k^-$▫ are equivalence relations on the vertex set of a given digraph. We prove that, for transitive digraphs, properties of these relations are closely related to other properties such as having property ▫$\mathbb{Z}$▫, the number of ends, growth conditions, and vertex degree.
Najdeno v: ključnih besedah
Povzetek najdenega: ...we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight...
Ključne besede: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Objavljeno: 03.04.2017; Ogledov: 826; Prenosov: 74
URL Polno besedilo (0,00 KB)

6.
Two-arc-transitive two-valent digraphs of certain orders
Katja Berčič, Primož Potočnik, 2016, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...graph, digraph, arc-transitive, order, ...
Ključne besede: graph, digraph, arc-transitive, order
Objavljeno: 08.08.2016; Ogledov: 896; Prenosov: 56
URL Polno besedilo (0,00 KB)

7.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation...
Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Objavljeno: 08.05.2018; Ogledov: 570; Prenosov: 72
URL Polno besedilo (0,00 KB)

8.
Automorphism groups of circulant digraphs with applications to semigroup theory
Joao Araújo, Wolfram Bentz, Edward Dobson, Janusz Konieczny, Joy Morris, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...automorphism group, circulant digraph, semigroup...
Ključne besede: automorphism group, circulant digraph, semigroup
Objavljeno: 08.05.2018; Ogledov: 787; Prenosov: 71
URL Polno besedilo (0,00 KB)

9.
MIPUP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...minimum conflict-free row split problem,, branching, acyclic digraph, integer linear programming...
Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming
Objavljeno: 17.09.2018; Ogledov: 290; Prenosov: 48
URL Polno besedilo (0,00 KB)

10.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Povzetek najdenega: ...phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation...
Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Objavljeno: 17.09.2018; Ogledov: 210; Prenosov: 5
URL Polno besedilo (0,00 KB)

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