| 词汇 | multigraph |
| 释义 | BETA Examples of multigraphmultigraph isn’t in the Cambridge Dictionary yet. You can help! A random railway is a random 3-regular multigraph where each vertex is regarded as a switch in a randomly chosen orientation. By we denote the cubic multigraph consisting of two vertices and three parallel edges joining them. In contrast, a map is a connected multigraph (with loops and multiple edges allowed) together with a given embedding in the plane. The component-connector model with multigraph data structure which joins function and structure is used for representing the conceptual model of a product. We study the concept of list total colourings and prove that every multigraph of maximum degree 3 is 5-total-choosable. The set of exposed vertices forms a connected component in the underlying multigraph. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers. We consider a random generalized railway defined as a random 3-regular multigraph where some vertices are regarded as switches that only allow traffic between certain pairs of attached edges. In such a case it was contemplated that we should have to multigraph the register. From the Hansard archive Example from the Hansard archive. Contains Parliamentary information licensed under the Open Parliament Licence v3.0 It may have to be multigraphed. From the Hansard archive Example from the Hansard archive. Contains Parliamentary information licensed under the Open Parliament Licence v3.0 A current conjecture is that if is a -regular planar multigraph, then is -edge-colorable if and only if is oddly -edge-connected. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The result is a 2-cell embedding of the derived multigraph, the two-cells of which are the disks corresponding to the orbits of. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Every rotation scheme defines a unique 2-cell embedding of a connected multigraph on a closed oriented surface (up to orientation preserving topological equivalence). From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Moreover, it is also a special case of the edge list coloring conjecture saying that the same holds not only for bipartite graphs, but also for any loopless multigraph. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Taking a random matching of the "nr" points, and then contracting the "r" points in each bucket into a single vertex, yields an "r" -regular graph or multigraph. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. In the terminology of the article on graphs, it is a "multigraph", but we say "graph" because in signed graph theory it is usually unnatural to restrict to simple graphs. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。