Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01779489n
Noun Concept
FR
graphe moulin
FR
En théorie des graphes, le graphe moulin Wd est un graphe non orienté construit, pour deux entiers k ≥ 2 et n ≥ 2, en joignant n copies du graphe complet Kk à un sommet universel partagé. Wikipedia
Definitions
Relations
Sources
FR
En théorie des graphes, le graphe moulin Wd est un graphe non orienté construit, pour deux entiers k ≥ 2 et n ≥ 2, en joignant n copies du graphe complet Kk à un sommet universel partagé. Wikipedia
IS A
graphe trivialement parfait
graphe de blocs
graphe
HAS KIND
graphe étoile
graphe d'amitié
HAS INSTANCE
graphe papillon
DEPICTS
moulin
NAMED AFTER
moulin
STUDIED BY
théorie des graphes
Wikipedia
FR
graphe moulin
Wikidata
FR
graphe moulin

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