A
-
Annihilator graph
The annihilator graph of a 0-distributive lattice [Volume 7, Issue 3, 2018, Pages 1-18]
B
-
Binomial ideal
On matrix and lattice ideals of digraphs [Volume 7, Issue 2, 2018, Pages 35-46]
C
-
Code
PD-sets for codes related to flag-transitive symmetric designs [Volume 7, Issue 1, 2018, Pages 37-50]
-
Covering number
Degree resistance distance of trees with some given parameters [Volume 7, Issue 4, 2018, Pages 11-24]
D
-
Degree resistance distance
Degree resistance distance of trees with some given parameters [Volume 7, Issue 4, 2018, Pages 11-24]
-
Diameter
New class of integral bipartite graphs with large diameter [Volume 7, Issue 1, 2018, Pages 13-17]
-
Diameter
Degree resistance distance of trees with some given parameters [Volume 7, Issue 4, 2018, Pages 11-24]
-
Directed graph
On matrix and lattice ideals of digraphs [Volume 7, Issue 2, 2018, Pages 35-46]
F
-
Fubini number
The log-convexity of the fubini numbers [Volume 7, Issue 2, 2018, Pages 17-23]
I
-
Integral graph
New class of integral bipartite graphs with large diameter [Volume 7, Issue 1, 2018, Pages 13-17]
M
-
Matrix ideals
On matrix and lattice ideals of digraphs [Volume 7, Issue 2, 2018, Pages 35-46]
N
-
Nordhaus-Gaddum inequalities
Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues [Volume 7, Issue 1, 2018, Pages 31-36]
P
-
Product code
On the minimum stopping sets of product codes [Volume 7, Issue 4, 2018, Pages 1-6]
S
-
Stopping distance
On the minimum stopping sets of product codes [Volume 7, Issue 4, 2018, Pages 1-6]
-
Stopping set
On the minimum stopping sets of product codes [Volume 7, Issue 4, 2018, Pages 1-6]
T
-
Trees
Degree resistance distance of trees with some given parameters [Volume 7, Issue 4, 2018, Pages 11-24]
W
-
Weighted digraphs
Iota energy of weighted digraphs [Volume 7, Issue 3, 2018, Pages 55-73]
Z
-
Zero-divisor graph
The annihilator graph of a 0-distributive lattice [Volume 7, Issue 3, 2018, Pages 1-18]
Your query does not match with any item
