Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01826441n
Noun Concept
Categories: Graph families, Perfect graphs
EN
strongly chordal graph
EN
In the mathematical area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length in G has an odd chord, i.e., an edge that connects two vertices that are an odd distance apart from each other in the cycle. Wikipedia
Definitions
Sources
EN
In the mathematical area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length in G has an odd chord, i.e., an edge that connects two vertices that are an odd distance apart from each other in the cycle. Wikipedia
Wikipedia
EN
strongly chordal graph
Wikidata
EN
Strongly chordal graph

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