Volume 3, Issue 1
مرور بر اساس
ارسال های اخیر
-
On the number of maximum independent sets of graphs
(University of Isfahan, 2014-03-01)Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize ...
-
On the number of mutually disjoint cyclic designs
(University of Isfahan, 2014-03-01)We denote by $LS[N](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $N$, which is a partition of all $k$-subsets of a $v$-set into $N$ disjoint $t$-$(v,k,lambda)$ designs and $N={v-t choose k-t}/lambda$. ...
-
Some designs and codes from $L_2(q)$
(University of Isfahan, 2014-03-01)For $q in {7,8,9,11,13,16}$, we consider the primitive actions of $L_2(q)$ and use Key-Moori Method 1 as described in [Codes, designs and graphs from the Janko groups {$J_1$} and {$J_2$}, J. Combin. Math. ...
-
On the symmetries of some classes of recursive circulant graphs
(University of Isfahan, 2014-03-01)A recursive-circulant $G(n; d)$ is defined to be a circulant graph with $n$ vertices and jumps of powers of $d$. $G(n; d)$ is vertex-transitive, and has some strong hamiltonian properties. $G(n;d)$ has a ...
