"graph" nach Englisch mit Beispielen - Kollokationen-Wörterbuch Englisch
- Let be the set of all connected -regular graphs with at least vertices.
- This problem can be overcome by using hypergraphs instead of regular graphs.
- It is the unique strongly regular graph with parameters (50,7,0,1).
- That is, a regular graph has a 1-factorization if and only if it is of class 1.
- It is also possible to find regular graphs with the same properties .
- It is the unique strongly regular graph with parameters (81, 20, 1, 6).
- There is also a criterion for regular and connected graphs :
- If a graph is 1-factorable, then it has to be a regular graph.
- Any regular graph with an odd number of nodes.
- Every strongly regular graph is symmetric, but not vice versa.
Klicken Sie die ausgewählten Überschrift, um die Gruppe von Kollokationen, Kollokationen und Beispielsätze einzublenden .