EulerianGraphQ

Tilgjengelig

Test whether a graph has an Eulerian circuit

Former

EulerianGraphQ[g]

Verifiserte eksempler{ConnectedGraphQ[g], EulerianGraphQ[g]} → {False, False}

Kjør dette på Qurak Søk i referansen

Emner

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

Relatert

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

Alle 6300 funksjoner · Bruk dette fra en MCP-klient