@Article{Reddy2013,
author="Reddy, P. Siva
and Rajanna, K. R.
and Permi, Kavita S",
title="The common minimal common neighborhood dominating signed graphs",
journal="Transactions on Combinatorics",
year="2013",
volume="2",
number="1",
pages="1-8",
abstract="In this paper, we define the common minimal common neighborhood dominating signed graph (or common minimal $CN$-dominating signed graph) of a given signed graph and offer a structural characterization of common minimal $CN$-dominating signed graphs. In the sequel, we also obtained switching equivalence
characterization: $\overline{\Sigma} \sim CMCN(\Sigma)$, where $\overline{\Sigma}$ and $CMCN(\Sigma)$ are complementary signed graph and common minimal $CN$-signed graph of $\Sigma$ respectively.",
issn="2251-8657",
doi="10.22108/toc.2013.2640",
url="http://toc.ui.ac.ir/article_2640.html"
}
@Article{Dehgardai2013,
author="Dehgardai, Nasrin
and Norouzian, Sepideh
and Sheikholeslami, Seyed Mahmoud",
title="Bounding the domination number of a tree in terms of its annihilation number",
journal="Transactions on Combinatorics",
year="2013",
volume="2",
number="1",
pages="9-16",
abstract="A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $V-S$ is adjacent to some vertex in $S$. The domination number $\gamma(G)$ is the minimum cardinality of a dominating set in $G$. The annihilation number $a(G)$ is the largest integer $k$ such that the sum of the first $k$ terms of the non-decreasing degree sequence of $G$ is at most the number of edges in $G$. In this paper, we show that for any tree $T$ of order $n\ge 2$, $\gamma(T)\le \frac{3a(T)+2}{4}$, and we characterize the trees achieving this bound.",
issn="2251-8657",
doi="10.22108/toc.2013.2652",
url="http://toc.ui.ac.ir/article_2652.html"
}
@Article{Sobhani2013,
author="Sobhani, Reza",
title="Gray isometries for finite $p$-groups",
journal="Transactions on Combinatorics",
year="2013",
volume="2",
number="1",
pages="17-26",
abstract="We construct two classes of Gray maps, called type-I Gray map and type-II Gray map, for a finite $p$-group $G$. Type-I Gray maps are constructed based on the existence of a Gray map for a maximal subgroup $H$ of $G$. When $G$ is a semidirect product of two finite $p$-groups $H$ and $K$, both $H$ and $K$ admit Gray maps and the corresponding homomorphism $\psi:H\longrightarrow {\rm Aut}(K)$ is compatible with the Gray map of $K$ in a sense which we will explain, we construct type-II Gray maps for $G$. Finally, we consider group codes over the dihedral group $D_8$ of order 8 given by the set of their generators, and derive a representation and an encoding procedure for such codes.",
issn="2251-8657",
doi="10.22108/toc.2013.2762",
url="http://toc.ui.ac.ir/article_2762.html"
}
@Article{Cai2013,
author="Cai, Qingqiong
and Li, Xueliang
and Song, Jiangli",
title="New skew Laplacian energy of simple digraphs",
journal="Transactions on Combinatorics",
year="2013",
volume="2",
number="1",
pages="27-37",
abstract="For a simple digraph $G$ of order $n$ with vertex set $\{v_1,v_2,\ldots, v_n\}$, let $d_i^+$ and $d_i^-$ denote the out-degree and in-degree of a vertex $v_i$ in $G$, respectively. Let $D^+(G)=diag(d_1^+,d_2^+,\ldots,d_n^+)$ and $D^-(G)=diag(d_1^-,d_2^-,\ldots,d_n^-)$. In this paper we introduce $\widetilde{SL}(G)=\widetilde{D}(G)-S(G)$ to be a new kind of skew Laplacian matrix of $G$, where $\widetilde{D}(G)=D^+(G)-D^-(G)$ and $S(G)$ is the skew-adjacency matrix of $G$, and from which we define the skew Laplacian energy $SLE(G)$ of $G$ as the sum of the norms of all the eigenvalues of $\widetilde{SL}(G)$. Some lower and upper bounds of the new skew Laplacian energy are derived and the digraphs attaining these bounds are also determined.",
issn="2251-8657",
doi="10.22108/toc.2013.2833",
url="http://toc.ui.ac.ir/article_2833.html"
}
@Article{Lalwani2013,
author="Lalwani, Soniya
and Singhal, Sorabh
and Kumar, Rajesh
and Gupta, Nilama",
title="A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm",
journal="Transactions on Combinatorics",
year="2013",
volume="2",
number="1",
pages="39-101",
abstract="Numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of Multi-Objective Optimization (MOO) had arisen several years ago. Due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by Swarm Intelligence (SI) techniques. Particle Swarm Optimization (PSO) has been established in 1995 and became a very mature and most popular domain in SI. Multi-Objective PSO (MOPSO) established in 1999, has become an emerging field for solving MOOs with a large number of extensive literature, software, variants, codes and applications. This paper reviews all the applications of MOPSO in miscellaneous areas followed by the study on MOPSO variants in our next publication. An introduction to the key concepts in MOO is followed by the main body of review containing survey of existing work, organized by application area along with their multiple objectives, variants and further categorized variants.",
issn="2251-8657",
doi="10.22108/toc.2013.2834",
url="http://toc.ui.ac.ir/article_2834.html"
}
@Article{Eskender2013,
author="Eskender, Buzohragul
and Vumar, Elkin",
title="Eccentric connectivity index and eccentric distance sum of some graph operations",
journal="Transactions on Combinatorics",
year="2013",
volume="2",
number="1",
pages="103-111",
abstract="Let $G=(V,E)$ be a connected graph. The eccentric connectivity index of $G$, $\xi^{c}(G)$, is defined as
$\xi^{c}(G)=\sum_{v\in V(G)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. The eccentric distance sum of $G$ is defined as $\xi^{d}(G)=\sum_{v\in V(G)}ec(v)D(v)$, where $D(v)=\sum_{u\in V(G)}d(u,v)$. In this paper, we calculate the eccentric connectivity index and eccentric distance sum of generalized hierarchical product of graphs. Moreover, we present the exact formulae for the eccentric connectivity index of $F$-sum graphs in terms of some invariants of the factors.",
issn="2251-8657",
doi="10.22108/toc.2013.2839",
url="http://toc.ui.ac.ir/article_2839.html"
}