Wiktionary英語版

出典：Wiktionary

Petersen graph

出典:『Wiktionary』 (2025/03/13 18:27 UTC 版)

語源

Named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.

名詞

Petersen graph (plural Petersen graphs)

  1. (graph theory) An undirected graph with 10 vertices and 15 edges, serving as a simple example and counterexample for many problems in graph theory.
調べた例文を記録して、効率よく覚えましょう
Weblio会員無料で登録できます
履歴機能 過去に調べた単語を確認できる
語彙力診断 診断回数が4回に増加
マイ単語帳 便利な学習機能付き
マイ例文帳 文章で意味を理解できる
Weblio会員登録(無料)はこちらから▶

ウィキペディア英語版

出典：Wikipedia

Petersen graph

出典:『Wikipedia』 (2011/07/22 19:26 UTC 版)

英語による解説

ウィキペディア英語版からの引用
引用

In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named for Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by A. B. Kempe ().

Petersen graphのページの著作権