nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algebraic and topological closure conditions for classes of pseudo-Boolean functions
|
Foldes, Stephan |
|
2009 |
157 |
13 |
p. 2818-2827 10 p. |
artikel |
2 |
A note on the minimum bounded edge-partition of a tree
|
Dye, Shane |
|
2009 |
157 |
13 |
p. 2958-2963 6 p. |
artikel |
3 |
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
|
Hattingh, Johannes H. |
|
2009 |
157 |
13 |
p. 2846-2858 13 p. |
artikel |
4 |
Atom–bond connectivity index of trees
|
Furtula, Boris |
|
2009 |
157 |
13 |
p. 2828-2835 8 p. |
artikel |
5 |
Broadcasting from multiple originators
|
Liestman, Arthur L. |
|
2009 |
157 |
13 |
p. 2886-2891 6 p. |
artikel |
6 |
Characterizations of competition multigraphs
|
Sano, Yoshio |
|
2009 |
157 |
13 |
p. 2978-2982 5 p. |
artikel |
7 |
Complete catalogue of graphs of maximum degree 3 and defect at most 4
|
Miller, Mirka |
|
2009 |
157 |
13 |
p. 2983-2996 14 p. |
artikel |
8 |
Complexity of ( p , 1 ) -total labelling
|
Havet, Frédéric |
|
2009 |
157 |
13 |
p. 2859-2870 12 p. |
artikel |
9 |
Contents
|
|
|
2009 |
157 |
13 |
p. vii-viii nvt p. |
artikel |
10 |
Cyclic and negacyclic codes over the Galois ring GR ( p 2 , m )
|
Sobhani, R. |
|
2009 |
157 |
13 |
p. 2892-2903 12 p. |
artikel |
11 |
Domination in a digraph and in its reverse
|
Niepel, L’udovít |
|
2009 |
157 |
13 |
p. 2973-2977 5 p. |
artikel |
12 |
Domination, radius, and minimum degree
|
Henning, Michael A. |
|
2009 |
157 |
13 |
p. 2964-2968 5 p. |
artikel |
13 |
Editorial Board
|
|
|
2009 |
157 |
13 |
p. v-vi nvt p. |
artikel |
14 |
Full orientability of graphs with at most one dependent arc
|
Lai, Hsin-Hao |
|
2009 |
157 |
13 |
p. 2969-2972 4 p. |
artikel |
15 |
Kirchhoff index of composite graphs
|
Zhang, Heping |
|
2009 |
157 |
13 |
p. 2918-2927 10 p. |
artikel |
16 |
More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index”
|
Pavlović, Ljiljana |
|
2009 |
157 |
13 |
p. 2938-2944 7 p. |
artikel |
17 |
Neighborhood hypergraphs of digraphs and some matrix permutation problems
|
Gurvich, Vladimir |
|
2009 |
157 |
13 |
p. 2836-2845 10 p. |
artikel |
18 |
On a problem related to the Vandermonde determinant
|
Sogabe, Tomohiro |
|
2009 |
157 |
13 |
p. 2997-2999 3 p. |
artikel |
19 |
On complexity of Minimum Leaf Out-Branching problem
|
Dankelmann, Peter |
|
2009 |
157 |
13 |
p. 3000-3004 5 p. |
artikel |
20 |
On the complexity of paths avoiding forbidden pairs
|
Kolman, Petr |
|
2009 |
157 |
13 |
p. 2871-2876 6 p. |
artikel |
21 |
On the degree distance of a graph
|
Dankelmann, P. |
|
2009 |
157 |
13 |
p. 2773-2777 5 p. |
artikel |
22 |
On the extremal Merrifield–Simmons index and Hosoya index of quasi-tree graphs
|
Li, Shuchao |
|
2009 |
157 |
13 |
p. 2877-2885 9 p. |
artikel |
23 |
On well-covered triangulations: Part II
|
Finbow, Arthur S. |
|
2009 |
157 |
13 |
p. 2799-2817 19 p. |
artikel |
24 |
Optical grooming with grooming ratio eight
|
Colbourn, Charles J. |
|
2009 |
157 |
13 |
p. 2763-2772 10 p. |
artikel |
25 |
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
|
Du, Dingzhu |
|
2009 |
157 |
13 |
p. 2778-2784 7 p. |
artikel |
26 |
Resource augmented semi-online bounded space bin packing
|
Epstein, Leah |
|
2009 |
157 |
13 |
p. 2785-2798 14 p. |
artikel |
27 |
Size of random Galois lattices and number of closed frequent itemsets
|
Emilion, Richard |
|
2009 |
157 |
13 |
p. 2945-2957 13 p. |
artikel |
28 |
The mathematical solution of a cellular automaton model which simulates traffic flow with a slow-to-start effect
|
Tian, Ran |
|
2009 |
157 |
13 |
p. 2904-2917 14 p. |
artikel |
29 |
The signless Laplacian spectral radius of graphs with given degree sequences
|
Zhang, Xiao-Dong |
|
2009 |
157 |
13 |
p. 2928-2937 10 p. |
artikel |