#### Filter Results:

#### Publication Year

1978

2009

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Cornelis Hoede, Xueliang Li
- Discrete Mathematics
- 1994

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.

- Cornelis Hoede
- Journal of Graph Theory
- 1992

A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterizing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterization is given in terms of fundamental cycles of a cycle basis.

- Lei Zhang, Cornelis Hoede
- 2002

- Cornelis Hoede, L. Zhang
- ICCS
- 2001

This is the third paper in a series of natural language processing in term of knowledge graphs. A word is a basic unit in natural language processing. This is why we study word graphs. Word graphs were already built for prepositions and adwords (including adjectives, adverbs and Chinese quantity words) in two other papers [2], [3]. In this paper, we propose… (More)

- Hajo Broersma, Cornelis Hoede
- Journal of Graph Theory
- 1989

The concept of a line graph is generalized to that of a path graph. The path graph f,(G) of a graph G is obtained by representing the paths Pk in G by vertices and joining two vertices whenever the corresponding paths f k in G form a path f k + , or a cycle C,. f,-graphs are characterized and investigated on isomorphism and traversability. Trees and… (More)

- Cor van Dijkum, Dorien DeTombe, +7 authors Dorien J. DeTombe
- 1999

©1999 No part of this book may be reproduced in any form by print, photoprint, microfilm or any other means without the prior written permission from the publisher. A publication in coöperation with the Dutch researchgroups SIMULATION and COMPLEX SOCIETAL PROBLEMS of the NOSMO (Dutch Research group on Methodology) Validation of simulation models in the… (More)

- Ligong Wang, Xueliang Li, Cornelis Hoede
- Discrete Mathematics
- 2004

A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to… (More)

- Cornelis Hoede
- 2000

In this paper the results are given of an investigation into concepts from Economics, Organization Theory, Political Science, Psychology and Sociology. The goal of this investigation was to find out whether there is a set of concepts that may be considered to be basic to all these five social sciences. The set of concepts found will be modeled in terms of… (More)

- Cornelis Hoede, X. Liu
- ICCS
- 1998

- F. Göbel, Cornelis Hoede
- Ars Comb.
- 1999