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