Bannai and Ito defined association scheme theory as doing ''group theory without groups'', thus raising a basic question as to which results about permutation groups are, in fact, results about association schemes? By considering transitive permutation groups in a wider setting of association schemes, it is shown that one such result is a generalisation from odd primes p to arbitrary prime powers pn, of the classical theorem of Wielandt about primitive permutation groups of degree 2p^n, p ) 2 a prime, being of rank 3.
COBISS.SI-ID: 1024198996
This article, published in the esteemed scientific journal Science, uses game theory and economic laboratory experiments with human subjects to study the impact of punishment on the evolution of co-operation between strangers. It is the first ever article in this journal by a researcher at a research institution in Slovenia that studies a social sciences topic.
COBISS.SI-ID: 1024190804
In this paper an "if and only if" condition for a minimal idempotent (which is not the trivial idempotent) of a distance-regular graph with diameter d=) 3 to be Q-polynomial is given.
COBISS.SI-ID: 15688537
In this paper a sharp upper bound on the algebraic connectivity of a connected graph in terms of the domination number is proven. In addition, the associated extremal graphs are characterized.
COBISS.SI-ID: 516165913
This article, with an innovative approach for finding Hamilton paths/cycles in cubic Cayley graphs, based on embeddings onto appropriate closed orientable surfaces, gives constructions of Hamilton cycles in cubic Cayley graphs associated with groups having a (2,4k,3)-presentation. It thus gives an important step forward with respect to the long standing open problem of the existence of Hamilton cycles in connected Cayley graphs.
COBISS.SI-ID: 1024072020