Printer Friendly
Dictionary, Encyclopedia and Thesaurus - The Free Dictionary
3,915,565,660 visitors served.
forum Join the Word of the Day Mailing List For webmasters
?
Dictionary/
thesaurus
Medical
dictionary
Legal
dictionary
Financial
dictionary
Acronyms
 
Idioms
Encyclopedia
Wikipedia
encyclopedia
?

strongly connected digraph

    0.01 sec.
strongly connected digraph [¦strȯŋ·lē kə¦nek·təd ′dī‚graf]
(mathematics)
A directed graph in which there is a directed path from every vertex to every other vertex.


Want to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit the webmaster's page for free fun content.
?Page tools
Printer friendly
Cite / link
Feedback
Mentioned in?  References in periodicals archive?   Encyclopedia browser?   Full browser?
No references found
 
Ranjan Chaudhuri, Eastern Michigan University, Department of Computer Science, Ypsilanti, MI 48197 Let G = (V, E) be a strongly connected digraph such that the outdegree of each vertex is two.
Ranjan Chaudhuri, Eastern Michigan University Let G=(V,E) be a strongly connected digraph in which the out-degree of each vertex is equal to two.
 
 
 
Encyclopedia
?

Terms of Use | Privacy policy | Feedback | Advertise with Us | Copyright © 2012 Farlex, Inc.
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.