Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03541976n
Noun Concept
SYL
No term available
EN
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. Wikipedia
Relations
Sources
IS A
EN
directed graph
EN
component
STUDIED BY
EN
graph theory

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License