مرور Volume 1, Issue 2 بر اساس عنوان
در حال نمایش موارد 1 - 5 از 5
-
Connected cototal domination number of a graph
(University of Isfahan, 2012-06-01)A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq varnothing $, contains no isolated vertices. A connected ...
-
Degree resistance distance of unicyclic graphs
(University of Isfahan, 2012-06-01)Let $G$ be a connected graph with vertex set $V(G)$. The degree resistance distance of $G$ is defined as $D_R(G) = sum_{{u, v} subseteq V(G)} [d(u)+d(v)] R(u,v)$, where $d(u)$ is the degree of vertex $u$, and ...
-
On the girth of Tanner (3,7) quasi-cyclic LDPC codes
(University of Isfahan, 2012-06-01)S. Kim et al. have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner $(3,5)$ of length $5p$, where $p$ is a prime of the form ...
-
The order difference interval graph of a group
(University of Isfahan, 2012-06-01)In this paper we introduce the concept of order difference interval graph $Gamma_{ODI}(G)$ of a group $G$. It is a graph $Gamma_{ODI}(G)$ with $V(Gamma_{ODI}(G)) = G$ and two vertices $a$ and $b$ are adjacent in ...
-
Some results on characterization of finite group by non commuting graph
(University of Isfahan, 2012-06-01)The non commuting graph $nabla(G)$ of a non-abelian finite group $G$ is defined as follows: its vertex set is $G- Z (G)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator ...
