Sampathkumar, E., Generalizations of independence and chromatic numbers of a graph, Discrete Mathematics 115 (1993) 2455251. Let G = (V, E) be a graph and k > 2 be an integer. A set S c V is k-independent if every component in the subgraph (S) induced by S has order at most k-1. The general chromati
A generalized measure of independence and the strong product of graphs
โ Scribed by B. H. Barnes; K. E. Mackey
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 583 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A special graph, the PS graph, is introduced and an algorithm is developed to generate all trees of such graphs. It is proved that for any given graph, G there exists certain number of PS graphs, obtained from G, such that the collection of all trees of all such PS graph span all trees of G with no
## Abstract This paper presents some recent results on lower bounds for independence ratios of graphs of positive genus and shows that in a limiting sense these graphs have the same independence ratios as do planar graphs. This last result is obtained by an application of Menger's Theorem to show t
We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive graphs. As a consequence of our main results, we positively solve