<span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> (plural <span class="searchmatch">undirected</span> <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) A <span class="searchmatch">graph</span> in which the edges are not ordered, so the edge (a, b) is identical to the edge (b,...
<span class="searchmatch">undirected</span> <span class="searchmatch">graphs</span> plural of <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span>...
on the jar close to the rim, and allowed it to trickle <span class="searchmatch">undirected</span> down the sides <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> <span class="searchmatch">undirected</span> path reinducted, uncredited, undercited...
<span class="searchmatch">undirected</span> path (plural <span class="searchmatch">undirected</span> paths) (<span class="searchmatch">graph</span> theory) In a directed <span class="searchmatch">graph</span>, a path in which the edges are not all oriented in the same direction. A path...
Wikipedia has an article on: diamond <span class="searchmatch">graph</span> Wikipedia diamond <span class="searchmatch">graph</span> (plural diamond <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) An <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> with four vertices and five edges...
grafo não-orientado m (plural grafos não-orientados) (<span class="searchmatch">graph</span> theory) <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> (<span class="searchmatch">graph</span> in which the edges are not ordered)...
article on: Heawood <span class="searchmatch">graph</span> Wikipedia Named after Percy John Heawood. Heawood <span class="searchmatch">graph</span> (plural Heawood <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) An <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> with 14 vertices...
Wikipedia has an article on: crown <span class="searchmatch">graph</span> Wikipedia crown <span class="searchmatch">graph</span> (plural crown <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) An <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> with 2n vertices in the two sets...
graph with no three-edge-coloring. Petersen <span class="searchmatch">graph</span> (plural Petersen <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) An <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> with 10 vertices and 15 edges, serving as...
<span class="searchmatch">graph</span> Wikipedia From the visual resemblance to the sails of a windmill. windmill <span class="searchmatch">graph</span> (plural windmill <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) The <span class="searchmatch">undirected</span> <span class="searchmatch">graph</span> Wd(k...