EulerianGraphQ

利用可能

Test whether a graph has an Eulerian circuit

形式

EulerianGraphQ[g]

検証済みの例{ConnectedGraphQ[g], EulerianGraphQ[g]} → {False, False}

Qurakで実行リファレンスを検索

トピック

Graph Paths Cycles And Flows - Cycles and Tours
Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - E
New In80 Mathematics And Algorithms - New Predicates and Properties »
Summary Of New Features In141 - Graphs & Networks

関連

FindEulerianCycle HamiltonianGraphQ ConnectedGraphQ BipartiteGraphQ AcyclicGraphQ BetweennessCentrality ButterflyGraph ChromaticPolynomial GlobalClusteringCoefficient GraphAssortativity GraphDensity GraphDistanceMatrix

全 6300 関数 · MCPクライアントから使う