Undirected graph

Related Terms:

triangle free graph ordered edge chinese postman problem block graph herschel graph arboricity menger's theorem

Noun

Definition: A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).

We hope you enjoyed looking up some related words and definitions. We use various open machine learning and human sources to provide a more coherent reference that pure AI can provide. Although there are similar sites out there, they are filled with nonsense and gibberish due to their pure machine learning approach. Our dataset is in part derived from ConceptNet and WordNet with our own sprinkle of magic. We're always working on improving the data and adding more sources. Thanks for checking us out!