On strong digraphs with a unique minimally strong subdigraph

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper we determine the maximum number of edges that a strong digraph can have if it has a unique minimally strong subdigraph. We show that this number equals n(n-1)/2+1. Furthermore we show that there is, up to an isomorphism, a unique strong digraph which attains this maximum. © 1988.

Cite

CITATION STYLE

APA

Brualdi, R. A., & Manber, R. (1988). On strong digraphs with a unique minimally strong subdigraph. Discrete Mathematics, 71(1), 1–7. https://doi.org/10.1016/0012-365X(88)90025-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free