On strong digraphs with a unique minimally strong subdigraph (Q1102301)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On strong digraphs with a unique minimally strong subdigraph |
scientific article; zbMATH DE number 4049671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On strong digraphs with a unique minimally strong subdigraph |
scientific article; zbMATH DE number 4049671 |
Statements
On strong digraphs with a unique minimally strong subdigraph (English)
0 references
1988
0 references
A digraph is minimally strong if it is strong but no proper spanning subdigraph is strong. The authors show that if a strong digraph \(D_ n\) has a unique minimally strong subdigraph then \(D_ n\) has at most \(n(n- 1)/2+1\) edges with equality holding only if \(D_ n\) is isomorphic to a particular digraph.
0 references
minimally strong digraphs
0 references
0.8165705800056458
0 references
0.8116762638092041
0 references
0.8098918795585632
0 references
0.8003944158554077
0 references
0.7963153123855591
0 references
