no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A characterization of dissimilarity families of trees
|
Baldisserri, Agnese |
|
2017 |
220 |
C |
p. 35-45 11 p. |
article |
2 |
Comparing the metric and strong dimensions of graphs
|
Moravcik, Gaia |
|
2017 |
220 |
C |
p. 68-79 12 p. |
article |
3 |
Contents
|
|
|
2017 |
220 |
C |
p. v- 1 p. |
article |
4 |
Cycles embedding in folded hypercubes with conditionally faulty vertices
|
Kuo, Che-Nan |
|
2017 |
220 |
C |
p. 55-59 5 p. |
article |
5 |
Dominating and irredundant broadcasts in graphs
|
Mynhardt, C.M. |
|
2017 |
220 |
C |
p. 80-90 11 p. |
article |
6 |
Efficient minimization of higher order submodular functions using monotonic Boolean functions
|
Ramalingam, Srikumar |
|
2017 |
220 |
C |
p. 1-19 19 p. |
article |
7 |
Embedding various cycles with prescribed paths into k -ary n -cubes
|
Yang, Yuxing |
|
2017 |
220 |
C |
p. 161-169 9 p. |
article |
8 |
Extremal problems for trees with given segment sequence
|
Andriantiana, Eric Ould Dadah |
|
2017 |
220 |
C |
p. 20-34 15 p. |
article |
9 |
Fixed-parameter algorithms for DAG Partitioning
|
van Bevern, René |
|
2017 |
220 |
C |
p. 134-160 27 p. |
article |
10 |
On variants of conflict-free-coloring for hypergraphs
|
Cui, Zhen |
|
2017 |
220 |
C |
p. 46-54 9 p. |
article |
11 |
Shortcutting directed and undirected networks with a degree constraint
|
Tan, Richard B. |
|
2017 |
220 |
C |
p. 91-117 27 p. |
article |
12 |
The generalized 4-connectivity of hypercubes
|
Lin, Shangwei |
|
2017 |
220 |
C |
p. 60-67 8 p. |
article |
13 |
The maximum atom-bond connectivity index for graphs with edge-connectivity one
|
Cui, Qing |
|
2017 |
220 |
C |
p. 170-173 4 p. |
article |
14 |
The trees with the second smallest normalized Laplacian eigenvalue at least 1 − 3 2
|
Tian, Xiaoguo |
|
2017 |
220 |
C |
p. 118-133 16 p. |
article |