B
-
Balance
The common minimal common neighborhood dominating signed graphs [Volume 2, Issue 1, 2013, Pages 1-8]
-
Balance
Directionally $n$-signed graphs-III: the notion of symmetric balance [Volume 2, Issue 4, 2013, Pages 53-62]
-
Bucket recursive trees with variable capacities
of buckets
Probabilistic analysis of the first Zagreb index [Volume 2, Issue 2, 2013, Pages 35-40]
C
-
Cartesian product
Modular chromatic number of $C_m square P_n$ [Volume 2, Issue 2, 2013, Pages 47-72]
-
Clique
On the number of cliques and cycles in graphs [Volume 2, Issue 2, 2013, Pages 27-33]
-
Code
Gray isometries for finite $p$-groups [Volume 2, Issue 1, 2013, Pages 17-26]
-
Colorful Directed Paths
On the complexity of the colorful directed paths in vertex coloring of digraphs [Volume 2, Issue 2, 2013, Pages 1-7]
-
Common minimal $CN$-dominating signed graph
The common minimal common neighborhood dominating signed graphs [Volume 2, Issue 1, 2013, Pages 1-8]
-
Complementation
Directionally $n$-signed graphs-III: the notion of symmetric balance [Volume 2, Issue 4, 2013, Pages 53-62]
-
Computational Complexity
On the complexity of the colorful directed paths in vertex coloring of digraphs [Volume 2, Issue 2, 2013, Pages 1-7]
-
Conflicting objectives
A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm [Volume 2, Issue 1, 2013, Pages 39-101]
D
-
Dead-time Systems
Graph theoretical methods to study controllability and leader selection for dead-time systems [Volume 2, Issue 4, 2013, Pages 25-36]
-
Directional labeling
Directionally $n$-signed graphs-III: the notion of symmetric balance [Volume 2, Issue 4, 2013, Pages 53-62]
-
Domination Number
Bounding the domination number of a tree in terms of its annihilation number [Volume 2, Issue 1, 2013, Pages 9-16]
F
-
Finite group
Gray isometries for finite $p$-groups [Volume 2, Issue 1, 2013, Pages 17-26]
-
Friendship graphs
Graphs cospectral with a friendship graph or its complement [Volume 2, Issue 4, 2013, Pages 37-52]
-
Full friendly index sets
Full friendly index sets of slender and flat cylinder graphs [Volume 2, Issue 4, 2013, Pages 63-80]
G
-
Girth
Convolutional cylinder-type block-circulant cycle codes [Volume 2, Issue 2, 2013, Pages 9-17]
-
Graph Methods
Graph theoretical methods to study controllability and leader selection for dead-time systems [Volume 2, Issue 4, 2013, Pages 25-36]
-
Graph operations
Reciprocal degree distance of some graph operations [Volume 2, Issue 4, 2013, Pages 13-24]
-
Gray map
Gray isometries for finite $p$-groups [Volume 2, Issue 1, 2013, Pages 17-26]
H
-
Harary index
Reciprocal degree distance of some graph operations [Volume 2, Issue 4, 2013, Pages 13-24]
I
-
Independence polynomial
On the unimodality of independence polynomial of certain classes of graphs [Volume 2, Issue 3, 2013, Pages 33-41]
-
Isometry
Gray isometries for finite $p$-groups [Volume 2, Issue 1, 2013, Pages 17-26]
K
-
Kirchhoff index
Note on degree Kirchhoff index of graphs [Volume 2, Issue 3, 2013, Pages 43-52]
L
-
Laplacian energy
New skew Laplacian energy of simple digraphs [Volume 2, Issue 1, 2013, Pages 27-37]
-
Laplacian spectrum of graph
Note on degree Kirchhoff index of graphs [Volume 2, Issue 3, 2013, Pages 43-52]
-
LDPC codes
Convolutional cylinder-type block-circulant cycle codes [Volume 2, Issue 2, 2013, Pages 9-17]
-
Log-concave
On the unimodality of independence polynomial of certain classes of graphs [Volume 2, Issue 3, 2013, Pages 33-41]
M
-
Multi-Agent Systems
Graph theoretical methods to study controllability and leader selection for dead-time systems [Volume 2, Issue 4, 2013, Pages 25-36]
-
Multi-Objective Particle Swarm Optimization
A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm [Volume 2, Issue 1, 2013, Pages 39-101]
N
-
Negation
The common minimal common neighborhood dominating signed graphs [Volume 2, Issue 1, 2013, Pages 1-8]
-
Non-dominated solutions
A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm [Volume 2, Issue 1, 2013, Pages 39-101]
P
-
Pareto Optimal Set
A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm [Volume 2, Issue 1, 2013, Pages 39-101]
-
Particle Swarm Optimization
A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm [Volume 2, Issue 1, 2013, Pages 39-101]
-
Polyphenyl hexagonal chains
On the unimodality of independence polynomial of certain classes of graphs [Volume 2, Issue 3, 2013, Pages 33-41]
R
-
Reciprocal degree distance
Reciprocal degree distance of some graph operations [Volume 2, Issue 4, 2013, Pages 13-24]
-
Reduced distance matrix
On the spectra of reduced distance matrix of dendrimers [Volume 2, Issue 2, 2013, Pages 41-46]
-
Regular Dendrimers
On the spectra of reduced distance matrix of dendrimers [Volume 2, Issue 2, 2013, Pages 41-46]
-
Roman domination number
Roman game domination subdivision number of a graph [Volume 2, Issue 4, 2013, Pages 1-12]
-
Roman game domination subdivision number
Roman game domination subdivision number of a graph [Volume 2, Issue 4, 2013, Pages 1-12]
S
-
Signed graphs
The common minimal common neighborhood dominating signed graphs [Volume 2, Issue 1, 2013, Pages 1-8]
-
Signed graphs
Directionally $n$-signed graphs-III: the notion of symmetric balance [Volume 2, Issue 4, 2013, Pages 53-62]
-
Structural Controllability
Graph theoretical methods to study controllability and leader selection for dead-time systems [Volume 2, Issue 4, 2013, Pages 25-36]
-
Switching
The common minimal common neighborhood dominating signed graphs [Volume 2, Issue 1, 2013, Pages 1-8]
U
-
Unimodality
On the unimodality of independence polynomial of certain classes of graphs [Volume 2, Issue 3, 2013, Pages 33-41]
V
-
Vertex Coloring
On the complexity of the colorful directed paths in vertex coloring of digraphs [Volume 2, Issue 2, 2013, Pages 1-7]
Z
-
Zagreb index
Probabilistic analysis of the first Zagreb index [Volume 2, Issue 2, 2013, Pages 35-40]
Your query does not match with any item