On Clique Growth in Products of Directed Graphs
β Scribed by Stephan Brandt; Gunnar Brinkmann; Thomas Harmuth
- Publisher
- Springer Japan
- Year
- 1998
- Tongue
- English
- Weight
- 82 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique
## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree Ξ΄(__G__). The connectivity ΞΊ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertexβcuts. If ΞΊ(__G__)β<βΞ΄(__G__), then Topp and Volkmann 7 showed in 1993 f