In this paper the problem of characterizing extremal graphs K n relatively to the number of negative p -cycles , when the number of negative edges is fixed , is solved for large n . This number can be expressed as an alternating sum for which the Bonferroni inequalities hold . Finally , the asympto
β¦ LIBER β¦
Negative cycles in complete signed graphs
β Scribed by Dragos Radu Popescu; Ioan Tomescu
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 449 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Bonferroni Inequalities and Negative Cyc
β
DragoΕ Popescu; Ioan Tomescu
π
Article
π
1996
π
Elsevier Science
π
English
β 213 KB
On signed digraphs with all cycles negat
β
Frank Harary; J. Richard Lundgren; John S. Maybee
π
Article
π
1985
π
Elsevier Science
π
English
β 410 KB
On signed digraphs with all cycles negat
β
Guy Chaty
π
Article
π
1988
π
Elsevier Science
π
English
β 235 KB
On negative cycles in mixed graphs
β
Esther M Arkin; Christos H Papadimitriou
π
Article
π
1985
π
Elsevier Science
π
English
β 252 KB
Minimal complete matchings and negative
β
R. L. Tobin
π
Article
π
1975
π
John Wiley and Sons
π
English
β 627 KB
## Abstract Conditions are developed which relate the existence of negative and nonpositive simple cycles in an undirected network to minimal complete matchings on a derived network. These conditions are then used to develop a test to determine whether or not an undirected network contains nonposit
Packing complete multipartite graphs wit
β
Elizabeth J. Billington; Hung-Lin Fu; C.A. Rodger
π
Article
π
2001
π
John Wiley and Sons
π
English
β 394 KB
π 1 views