Name
Abstract | ||
|---|---|---|
Caccetta-Häggkvist's Conjecture discusses the relation between the girth g(D) of a digraph D and the minimum outdegree δċ(D) of D. The special case when g(D) = 3 has lately attracted wide attention. For an undirected graph G, the binding number bind(G) ≥ ??? is a sufficient condition for G to have a triangle (cycle with length 3). In this paper we generalize the concept of binding numbers to digraphs and give some corresponding results. In particular, the value range of binding numbers is given, and the existence of digraphs with a given binding number is confirmed. By using the binding number of a digraph we give a condition that guarantees the existence of a directed triangle in the digraph. The relationship between binding number and connectivity is also discussed. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/978-3-540-70666-3_24 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
corresponding result,sufficient condition,minimum outdegree,digraph d,special case,binding number bind,undirected graph,girth g,value range,binding number | Graph,Discrete mathematics,Combinatorics,Directed graph,Binding number,Cycle rank,Conjecture,Mathematics,Digraph,Special case | Conference |
Volume | Issue | ISSN |
4381 LNCS | null | 16113349 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genjiu Xu | 1 | 30 | 7.31 |
| Xueliang Li | 2 | 737 | 103.78 |
| Shenggui Zhang | 3 | 263 | 47.21 |