circuit
in graph theory, non-empty trail in which the first and last vertices are equal
| rdfs:label |
"circuit"@en
|
|
skos:alt |
"closed trail"@en
|
| schema:description |
"in graph theory, non-empty trail in which the first and last vertices are equal"@en
|
|
schema:date |
"2025-04-24T20:08:08+00:00"^^xsd:dateTime |
| schema:version | 2341419850 |
| wikibase:identifiers | 1 |
| wikibase:sitelinks | 3 |
| wikibase:statements | 5 |
| p:P1269 | wd:statement/Q17176291-AC58773D-819B-4209-AD48-65190B2FE719 |
| p:P279 | wd:statement/Q17176291-78ed878d-4e55-636b-d974-870cd6380011 |
| p:P2812 | wd:statement/Q17176291-52FDE799-0B33-4F51-958F-FDDF9D1EBB9F |
| p:P31 | wd:statement/Q17176291-2689079e-4ade-2b50-0f65-f365f0446317 |
| p:P6104 | wd:statement/Q17176291-62CC6AD3-8E86-444C-9295-19339C179E45 |
| wdt:P1269 | graph theory |
| wdt:P279 | trail |
| wdt:P2812 | "Circuit" |
| wdt:P31 | concept |
| wdt:P6104 | WikiProject Mathematics |
Download as: