On a conjecture of Fiedler and Markham
β Scribed by Xuerong Yong; Zheng Wang
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 468 KB
- Volume
- 288
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
For some special matrices, the conjecture is proved.
π SIMILAR VOLUMES
This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe
## Abstract Wang and Williams defined a __threshold assignment__ for a graph __G__ as an assignment of a nonβnegative weight to each vertex and edge of __G__, and a threshold __t__, such that a set __S__ of vertices is stable if and only if the total weight of the subgraph induced by __S__ does not
## Abstract It is shown that, for all sufficiently large __k__, the complete graph __K~n~__ can be decomposed into __k__ factors of diameter 2 if and only if __n__ β₯ 6__k__.