File tree 1 file changed +3
-3
lines changed
1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change 17
17
<A >n</A >-kings in the tournament (see <Ref Oper =" DigraphIsKing" />).<P />
18
18
19
19
If <A >D</A > is not tournament, then an error is given
20
- (see <Ref Prop =" IsTournament" />).
21
-
20
+ (see <Ref Prop =" IsTournament" />).
21
+
22
22
If the tournament contains a source, then the source is the only 2-king
23
23
(see <Ref Attr =" DigraphSources" />). The number of 2-kings in a tournament
24
24
without a source is at least three. A tournament cannot have exactly two
@@ -47,7 +47,7 @@ gap> DigraphKings(gr, 2);
47
47
If <A >D</A > is a tournament and <A >v</A > is a vertex in the tournament,
48
48
then this operation returns <K >true</K > if every other vertex of <A >D</A >
49
49
is reachable from <A >v</A > by a path of length at most <A >k</A >. Otherwise,
50
- an error is given.
50
+ an error is given.
51
51
52
52
If <K >true</K > is returned, then the vertex, <A >v</A >, is a <A >k</A >-king.
53
53
<P />
You can’t perform that action at this time.
0 commit comments