One important class of graphsconsists of those that do not have any loops or parallel edges.Such graphs are called simple. In asimple graph, no two edgesshare the same set of endpoints, so specifying two endpoints is su fficient to determine an edge. One important class of graphsconsists of those that do not have any loops or parallel edges.Such graphs are called simple. In asimple graph, no two edgesshare the same set of endpoints, so specifying two endpoints is su fficient to determine an edge.
Do'stlaringiz bilan baham: |
