The Minimum Size of Digraphs Satisfying Directed Cut Conditions

Huawen Ma and Guozeng Cui

Mathematical Problems in Engineering, 2022, vol. 2022, 1-6

Abstract: A directed graph (digraph) D of order n satisfies directed cut condition DCC if there are at least S arcs from any set S⊆VD, S≤n/2 to its complement S¯=VD/S. We show that a digraph D of even order n has at least 2n−3 arcs if D satisfies DCC.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/5815591.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/5815591.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5815591

DOI: 10.1155/2022/5815591

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().