Let G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G -F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G -J is connected. f(G), z ( G ) denote the cardinalities of a
โฆ LIBER โฆ
Minimal feedback vertex sets in directed split-stars
โ Scribed by Fu-Hsing Wang; Cheng-Ju Hsu; Jen-Chih Tsai
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 112 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On feedback vertex sets and nonseparatin
โ
Ewald Speckenmeyer
๐
Article
๐
1988
๐
John Wiley and Sons
๐
English
โ 341 KB
Minimal disconnecting sets in directed m
โ
John J. Jarvis; John B. Tindall
๐
Article
๐
1972
๐
John Wiley and Sons
๐
English
โ 474 KB
Primitivity and independent sets in dire
โ
Huajun Zhang
๐
Article
๐
2010
๐
John Wiley and Sons
๐
English
โ 92 KB
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