Semicomplete absorbent sets in digraphs
Let be a digraph and S a subset of vertices of D, S is an absorbent set if for every v in there exists a vertex u in S such that A subset S of V(D) is a semicomplete absorbent set if S is absorbent and the induced subdigraph is semicomplete. The minimum (respectively maximum) of the cardinalities of...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.06.010 |