| 11. | In an undirected graph, an degree three.
|
| 12. | The corresponding concept for undirected graphs is a forest, an undirected graph without cycles.
|
| 13. | The corresponding concept for undirected graphs is a forest, an undirected graph without cycles.
|
| 14. | The incidence poset of an undirected graph with height 2 that has as its elements.
|
| 15. | It is defined for every undirected graph and contains information about how the graph is connected.
|
| 16. | Let be a simple undirected graph.
|
| 17. | An undirected graph has a " spectrum " ) and a complete set of orthonormal eigenvectors.
|
| 18. | Thus, the "'local clustering coefficient for undirected graphs "'can be defined as
|
| 19. | Transforming an undirected graph into an equivalent directed graph is very easy, if you think about it.
|
| 20. | A theorem of states that every undirected graph has a " well-balanced orientation ".
|
