Lupa

Search the repository Help

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

Options:
  Reset


1 - 10 / 13
First pagePrevious page12Next pageLast page
1.
Automorphism groups of wreath product digraphs
Edward Dobson, Joy Morris, 2009, original scientific article

Found in: ključnih besedah
Summary of found: ...wreath product digraph, automorphism group, ...
Keywords: wreath product digraph, automorphism group
Published: 15.10.2013; Views: 2204; Downloads: 14
URL Full text (0,00 KB)
This document has more files! More...

2.
Some non-normal Cayley digraphs of the generalized quaternion group of certain orders
Edward Dobson, 2003, original scientific article

Found in: ključnih besedah
Summary of found: ...non-normal Cayley digraph, generalized quaternion group, ...
Keywords: non-normal Cayley digraph, generalized quaternion group
Published: 15.10.2013; Views: 1918; Downloads: 16
URL Full text (0,00 KB)
This document has more files! More...

3.
On Hamiltonicity of circulant digraphs of outdegree three
Štefko Miklavič, Primož Šparl, 2009, original scientific article

Abstract: 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\}$▫.
Found in: ključnih besedah
Summary of found: ...deals with Hamiltonicity of connected loopless circulant digraphs of outdegree three with connection set of...
Keywords: graph theory, circulant digraph, Hamilton cycle
Published: 15.10.2013; Views: 1342; Downloads: 54
URL Full text (0,00 KB)

4.
Automorphism groups of Cayley digraphs of Zp3
Edward Dobson, István Kovács, 2009, original scientific article

Found in: ključnih besedah
Summary of found: ...Cayley digraph, automorphism group, ...
Keywords: Cayley digraph, automorphism group
Published: 15.10.2013; Views: 2329; Downloads: 8
URL Full text (0,00 KB)
This document has more files! More...

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

Abstract: 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.
Found in: ključnih besedah
Summary of found: ...we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight...
Keywords: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Published: 03.04.2017; Views: 913; Downloads: 87
URL Full text (0,00 KB)

6.
Two-arc-transitive two-valent digraphs of certain orders
Katja Berčič, Primož Potočnik, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...graph, digraph, arc-transitive, order, ...
Keywords: graph, digraph, arc-transitive, order
Published: 08.08.2016; Views: 959; Downloads: 65
URL Full text (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, original scientific article

Found in: ključnih besedah
Summary of found: ...minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Published: 08.05.2018; Views: 666; Downloads: 86
URL Full text (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, original scientific article

Found in: ključnih besedah
Summary of found: ...automorphism group, circulant digraph, semigroup...
Keywords: automorphism group, circulant digraph, semigroup
Published: 08.05.2018; Views: 904; Downloads: 84
URL Full text (0,00 KB)

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

Found in: ključnih besedah
Summary of found: ...minimum conflict-free row split problem,, branching, acyclic digraph, integer linear programming...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming
Published: 17.09.2018; Views: 386; Downloads: 56
URL Full text (0,00 KB)

10.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 283; Downloads: 5
URL Full text (0,00 KB)

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