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 |
правильный