Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Josh B. Frye"'
Publikováno v:
IndraStra Global.
Let D be a directed graph with vertex set V. arc set A, and order n. The graph underlying D is the graph obtained from D by replacing each arc (u. v) is an element of A by an undirected edge {u. v} land then replacing each double edge by a single edg