nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Abstract sphere-of-influence graphs
|
Harary, Frank |
|
1993 |
17 |
11 |
p. 77-83 7 p. |
artikel |
2 |
A classification scheme for vulnerability and reliability parameters of graphs
|
Bagga, K.S. |
|
1993 |
17 |
11 |
p. 13-16 4 p. |
artikel |
3 |
Analysis and synthesis problems for network resilience
|
Colbourn, Charles J. |
|
1993 |
17 |
11 |
p. 43-48 6 p. |
artikel |
4 |
Computer based proofs by induction in graph theory— a house of cards?
|
Barefoot, C.A. |
|
1993 |
17 |
11 |
p. 17-23 7 p. |
artikel |
5 |
Construction of graphs with special properties
|
Randić, Milan |
|
1993 |
17 |
11 |
p. 129-138 10 p. |
artikel |
6 |
Evaluation of the characteristic polynomial of a graph
|
Z̆ivković, Tomislav P |
|
1993 |
17 |
11 |
p. 145-149 5 p. |
artikel |
7 |
Graphs with all diametral paths through distant central nodes
|
Buckley, Fred |
|
1993 |
17 |
11 |
p. 35-41 7 p. |
artikel |
8 |
Graph theoretic models in computer science II
|
Harary, Frank |
|
1993 |
17 |
11 |
p. ix-x nvt p. |
artikel |
9 |
Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
|
Graham, Niall |
|
1993 |
17 |
11 |
p. 69-74 6 p. |
artikel |
10 |
Minimal hyper-Hamilton laceable graphs
|
Lewinter, Martin |
|
1993 |
17 |
11 |
p. 125-127 3 p. |
artikel |
11 |
No-hole 2-distant colorings
|
Roberts, Fred S. |
|
1993 |
17 |
11 |
p. 139-144 6 p. |
artikel |
12 |
Parallel concepts in graph theory
|
|
|
1993 |
17 |
11 |
p. 75- 1 p. |
artikel |
13 |
Quantifying fault recovery in multiprocessor systems
|
Harary, Frank |
|
1993 |
17 |
11 |
p. 97-104 8 p. |
artikel |
14 |
Regularizing irregular graphs
|
Buckley, Fred |
|
1993 |
17 |
11 |
p. 29-33 5 p. |
artikel |
15 |
Reverse binary graphs
|
Das, Sajal K |
|
1993 |
17 |
11 |
p. 49-60 12 p. |
artikel |
16 |
Spanning subgraphs of a hypercube IV: Rooted trees
|
Harary, Frank |
|
1993 |
17 |
11 |
p. 85-88 4 p. |
artikel |
17 |
Subgraph generating functions in chemistry— An example for perfect matchings on honeycomb fragments
|
Klein, D.J |
|
1993 |
17 |
11 |
p. 113-123 11 p. |
artikel |
18 |
The expected number of pairs of connected nodes: Pair-connected reliability
|
Amin, A.T |
|
1993 |
17 |
11 |
p. 1-11 11 p. |
artikel |
19 |
The geodetic number of a graph
|
Harary, Frank |
|
1993 |
17 |
11 |
p. 89-95 7 p. |
artikel |
20 |
The Hamiltonian property of consecutive-d digraphs
|
Du, D.Z. |
|
1993 |
17 |
11 |
p. 61-63 3 p. |
artikel |
21 |
The neighborhood inclusion structure of a graph
|
Boesch, Frank |
|
1993 |
17 |
11 |
p. 25-28 4 p. |
artikel |
22 |
Variations on a hypercube: Embellishments of parallel architectures
|
Harary, Frank |
|
1993 |
17 |
11 |
p. 105-111 7 p. |
artikel |
23 |
Vulnerability in graphs of diameter four
|
Exoo, Geoffrey |
|
1993 |
17 |
11 |
p. 65-68 4 p. |
artikel |