مرور Volume 5, Issue 2 بر اساس عنوان
در حال نمایش موارد 1 - 5 از 5
-
Degree distance and Gutman index of increasing trees
(University of Isfahan, 2016-06-01)The Gutman index and degree distance of a connected graph $G$ are defined as begin{eqnarray*} textrm{Gut}(G)=sum_{{u,v}subseteq V(G)}d(u)d(v)d_G(u,v), end{eqnarray*} and begin{eqnarray*} ...
-
On spectra of unitary Cayley mixed graph
(University of Isfahan, 2016-06-01)In this paper we introduce mixed unitary Cayley graph $M_{n}$ $(n>1)$ and compute its eigenvalues. We also compute the energy of $M_{n}$ for some $n$.
-
On the number of connected components of divisibility graph for certain simple groups
(University of Isfahan, 2016-06-01)The divisibility graph $mathscr{D}(G)$ for a finite group $G$ is a graph with vertex set $cs(G)setminus{1}$ where $cs(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ ...
-
On the spectrum of $r$-orthogonal Latin squares of different orders
(University of Isfahan, 2016-06-01)Two Latin squares of order $n$ are orthogonal if in their superposition, each of the $n^{2}$ ordered pairs of symbols occurs exactly once. Colbourn, Zhang and Zhu, in a series of papers, determined the integers ...
-
Recursive construction of $(J,L)$ QC LDPC codes with girth 6
(University of Isfahan, 2016-06-01)In this paper, a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6. For a $J times L$ exponent matrix $E$, the lower bound $Q(E)$ is obtained ...
