multigraph


Also found in: Dictionary, Wikipedia.

multigraph

[′məl·tə‚graf]
(mathematics)
A graph with no loops.
A graph that may have more than one edge joining a particular pair of vertices.
Mentioned in ?
References in periodicals archive ?
The second part <conditions which fulfillment in the problem environment is required for successive action exercise> is an active fuzzy semantic network which formal description is a multigraph [G.
7 that the restriction sets of the shelling, along with the h-numbers of the resulting simplicial poset, can also be interpreted directly from the given multigraph.
Connexity's multigraph technology provides a powerful blend of consumer signals to get the right ad in front of the right person at the right time.
In [26], Tarjan states that although having less edges in the condensed graphs with this modification is desirable, in practice the added simplicity does not compensate for the cost of the reduction of multigraphs to simple digraphs.
For a given integer-weighted graph G, we consider a corresponding unweighted multigraph G' on the same set of vertices.
The affine 0-Bruhat graph is the directed multigraph with vertices W and a labeled edge [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] for every u[t.
This generalization is commonly called a multigraph, but since all the standard tools for graphs which we use can be trivially extended to multigraphs we will not emphasize this difference later.
Sporting a new design and improved integrated sound, the 17-inch Multigraph 447Za (actual viewing area of 16"), is a blend of state-of-the-art technology, multimedia features and emissions that meet the TCO'95 standard for safe use in the office or home.
n+1] be the multigraph on the vertex set [n + 1] with m edges between i and j for all 1 [less than or equal to] i < j [less than or equal to] n and l edges between i and n +1 for all 1 [less than or equal to] i [less than or equal to] n.
Based upon the award winning Multigraph 449X the new 449Xa combines a high-resolution Trinitron(TM) display with integrated stereo speakers.
Instead of translating consecutive gaps from set partitions into steps in the multigraph G, we examine each vertex in the arc diagram of a coloured permutation and assign each type of vertex to a step in G.
When he opened for business, he had three machines to work with: a tabletop mimeograph machine, a tabletop multigraph and an old L.