| 词条 | Descartes snark |
| 释义 |
| name = Descartes snark | image = | image_caption = Image of a Descartes snark. | namesake = Blanche Descartes | vertices = 210 | edges = 315 | girth = 5 | chromatic_index = 4 | properties = Cubic Snark }} In the mathematical field of graph theory, a Descartes snark is an undirected graph with 210 vertices and 315 edges. It is a snark, first discovered by William Tutte in 1948 under the pseudonym Blanche Descartes.[1] A Descartes snark is obtained from the Petersen graph by replacing each vertex with a nonagon and each edge with a particular graph closely related to the Petersen graph. Because there are multiple ways to perform this procedure, there are multiple Descartes snarks. Notes1. ^Descartes, Blanche. "[https://www.jstor.org/pss/3610702 Network Colorings]," The Mathematical Gazette (London, 32:299. p. 67–69, 1948. 1 : Graph families |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。