Vertex degrees and doubly stochastic graph matrices
β Scribed by Xiao-Dong Zhang
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 119 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graph matrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris' question on doubly stochastic graph matrices. These results may also be used to establish relations between graph structure and entries of doubly stochastic graph matrices. α§ 2010 Wiley
π SIMILAR VOLUMES
## Abstract For any __d__β©Ύ5 and __k__β©Ύ3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__β3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra
New local graph invariants, "regressive vertex degrees" (which are slightly augmented vertex degrees) are introduced on the basis of decreasing contributions of more remote vertexes to the classical vertex degrees. Several such invariants are proposed (BR?, ERP), SR?) where t (either t = 1 or t = 2)