B
-
Balance
The common minimal dominating signed graph [Volume 1, Issue 3, 2012, Pages 39-46]
C
-
Cartesian product
Hamilton-connected properties in cartesian product [Volume 1, Issue 3, 2012, Pages 11-19]
-
Choosability
The $L(2,1)$-choosability of cycle [Volume 1, Issue 3, 2012, Pages 21-38]
-
CN-Minimal Dominating (Graph)
Minimal, vertex minimal and commonality minimal CN-dominating graphs [Volume 1, Issue 1, 2012, Pages 21-29]
-
Common minimal dominating signed graph
The common minimal dominating signed graph [Volume 1, Issue 3, 2012, Pages 39-46]
-
Corona product
The Hosoya index and the Merrifield-Simmons index of some graphs [Volume 1, Issue 4, 2012, Pages 51-60]
D
-
Decomposition
Toeplitz graph decomposition [Volume 1, Issue 4, 2012, Pages 35-41]
-
Degree distance
Degree resistance distance of unicyclic graphs [Volume 1, Issue 2, 2012, Pages 27-40]
-
Degree resistance distance
Degree resistance distance of unicyclic graphs [Volume 1, Issue 2, 2012, Pages 27-40]
-
Determinant
Determinants of adjacency matrices of graphs [Volume 1, Issue 4, 2012, Pages 9-16]
-
Diameter
A note on the total domination supercritical graphs [Volume 1, Issue 3, 2012, Pages 1-4]
-
Domination Number
Connected cototal domination number of a graph [Volume 1, Issue 2, 2012, Pages 17-26]
-
Domination polynomial
On the values of independence and domination polynomials at specific points [Volume 1, Issue 2, 2012, Pages 49-57]
E
-
Edge distance-balanced
Note on edge distance-balanced graphs [Volume 1, Issue 1, 2012, Pages 1-6]
-
Eigenvalue
The eigenvalues and energy of integral circulant graphs [Volume 1, Issue 3, 2012, Pages 47-56]
-
Eulerian
The order difference interval graph of a group [Volume 1, Issue 2, 2012, Pages 59-65]
F
-
Finite groups
Some results on characterization of finite group by non commuting graph [Volume 1, Issue 2, 2012, Pages 41-48]
G
-
Girth
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [Volume 1, Issue 2, 2012, Pages 1-16]
-
Graphoidal labeling
On label graphoidal covering number-I [Volume 1, Issue 4, 2012, Pages 25-33]
H
-
Hamilton-connectedness
Hamilton-connected properties in cartesian product [Volume 1, Issue 3, 2012, Pages 11-19]
-
Hamilton cycle
Hamilton-connected properties in cartesian product [Volume 1, Issue 3, 2012, Pages 11-19]
-
Hamiltonian cycle
Complexity indices for the travelling salesman problem and data mining [Volume 1, Issue 1, 2012, Pages 35-43]
-
Hamilton path
Hamilton-connected properties in cartesian product [Volume 1, Issue 3, 2012, Pages 11-19]
-
Hosoya
Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs [Volume 1, Issue 4, 2012, Pages 1-7]
-
Hosoya index
The Hosoya index and the Merrifield-Simmons index of some graphs [Volume 1, Issue 4, 2012, Pages 51-60]
I
-
Independence number
Subgroup intersection graph of finite abelian groups [Volume 1, Issue 3, 2012, Pages 5-10]
-
Independence polynomial
On the values of independence and domination polynomials at specific points [Volume 1, Issue 2, 2012, Pages 49-57]
-
Integral circulant graph
The eigenvalues and energy of integral circulant graphs [Volume 1, Issue 3, 2012, Pages 47-56]
L
-
L(2, 1)-labeling
The $L(2,1)$-choosability of cycle [Volume 1, Issue 3, 2012, Pages 21-38]
-
Label graphoidal
covering number
On label graphoidal covering number-I [Volume 1, Issue 4, 2012, Pages 25-33]
-
Label graphoidal graph
On label graphoidal covering number-I [Volume 1, Issue 4, 2012, Pages 25-33]
-
LDPC codes
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [Volume 1, Issue 2, 2012, Pages 1-16]
-
Link of two graphs
The Hosoya index and the Merrifield-Simmons index of some graphs [Volume 1, Issue 4, 2012, Pages 51-60]
M
-
Majorization
A simple approach to order the multiplicative Zagreb indices of connected graphs [Volume 1, Issue 4, 2012, Pages 17-24]
-
Merrifield-Simmons index
Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs [Volume 1, Issue 4, 2012, Pages 1-7]
-
Merrifield-Simmons index
The Hosoya index and the Merrifield-Simmons index of some graphs [Volume 1, Issue 4, 2012, Pages 51-60]
N
-
Neighborhood
signed graph
The common minimal dominating signed graph [Volume 1, Issue 3, 2012, Pages 39-46]
-
Nilpotent groups
Some results on characterization of finite group by non commuting graph [Volume 1, Issue 2, 2012, Pages 41-48]
P
-
Path
The $L(2,1)$-choosability of cycle [Volume 1, Issue 3, 2012, Pages 21-38]
R
-
Regular graph
On the total domatic number of regular graphs [Volume 1, Issue 1, 2012, Pages 45-51]
-
Regular graph
Toeplitz graph decomposition [Volume 1, Issue 4, 2012, Pages 35-41]
-
Resistance distance (in graph)
Degree resistance distance of unicyclic graphs [Volume 1, Issue 2, 2012, Pages 27-40]
S
-
Signed graphs
The common minimal dominating signed graph [Volume 1, Issue 3, 2012, Pages 39-46]
-
Spectral clustering algorithms
Complexity indices for the travelling salesman problem and data mining [Volume 1, Issue 1, 2012, Pages 35-43]
-
Supercritical
A note on the total domination supercritical graphs [Volume 1, Issue 3, 2012, Pages 1-4]
-
Switching
The common minimal dominating signed graph [Volume 1, Issue 3, 2012, Pages 39-46]
-
Szeged index
On a relation between Szeged and Wiener indices of bipartite graphs [Volume 1, Issue 4, 2012, Pages 43-49]
T
-
Tanner graph
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [Volume 1, Issue 2, 2012, Pages 1-16]
-
Toeplitz graph
Toeplitz graph decomposition [Volume 1, Issue 4, 2012, Pages 35-41]
-
Torus
Product-cordial index and friendly index of regular graphs [Volume 1, Issue 1, 2012, Pages 15-20]
-
Total domination
A note on the total domination supercritical graphs [Volume 1, Issue 3, 2012, Pages 1-4]
-
Travelling Salesman Problem
Complexity indices for the travelling salesman problem and data mining [Volume 1, Issue 1, 2012, Pages 35-43]
U
-
Unicyclic graphs
A simple approach to order the multiplicative Zagreb indices of connected graphs [Volume 1, Issue 4, 2012, Pages 17-24]
V
-
Value
On the values of independence and domination polynomials at specific points [Volume 1, Issue 2, 2012, Pages 49-57]
W
-
Wiener index
On a relation between Szeged and Wiener indices of bipartite graphs [Volume 1, Issue 4, 2012, Pages 43-49]
Your query does not match with any item