theta graph
theta graph · theta graphs
The union of three internally disjoint paths that have the same two distinct end verticesThe union of three internally disjoint (simple) paths that have the same two distinct end vertices.
Значення
значень: 1The union of three internally disjoint (simple) paths that have the same two distinct end vertices.
Форми
множина: theta graphs| Однина | theta graph |
|---|---|
| Множина | theta graphs |
правильне