EulerianGraphQ

Khả dụng

Test whether a graph has an Eulerian circuit

Dạng

EulerianGraphQ[g]

Ví dụ đã kiểm chứng{ConnectedGraphQ[g], EulerianGraphQ[g]} → {False, False}

Chạy cái này trên Qurak Tìm trong tài liệu tham chiếu

Chủ đề

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

Liên quan

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

Tất cả 6300 hàm · Dùng cái này từ một client MCP