On upper bounds for the energy of digraphs
β Scribed by Tian, Gui-Xian; Cui, Shu-Yu
- Book ID
- 122877082
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 280 KB
- Volume
- 438
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let D be a strongly k-connected digraph of order n/> 2. We prove that for every l >i n/2k the power D t of D is Hamiltonian. Moreover, for any k >/1 and n > 2k we exhibit a strongly k-connected digraph D of order n such that D rn/2kl-1 is non-Hamiltonian. We use standard terminology, unless otherwi
Expressions mo derived that bound from above the Helmhoitz free energy of a &as&cat system. Letf be the Helmholta free energy per particle, p \*he number density, andg(r) the pair fra-dial} distribution function of a classical singiespecies system, the energy of which is a sum of one-body and two-b