词条 | Multiple edges |
释义 |
In graph theory, multiple edges (also called parallel edges or a multi-edge), are two or more edges that are incident to the same two vertices. A simple graph has no multiple edges. Depending on the context, a graph may be defined so as to either allow or disallow the presence of multiple edges (often in concert with allowing or disallowing loops):
Multiple edges are, for example, useful in the consideration of electrical networks, from a graph theoretical point of view.[3] Additionally, they constitute the core differentiating feature of multidimensional networks. A planar graph remains planar if an edge is added between two vertices already joined by an edge; thus, adding multiple edges preserves planarity.[4] A dipole graph is a graph with two vertices, in which all edges are parallel to each other. Notes1. ^For example, see Balakrishnan, p. 1, and Gross (2003), p. 4, Zwillinger, p. 220. 2. ^For example, see Bollobás, [https://books.google.com/books?id=SbZKSZ-1qrwC&pg=PA7 p. 7]; Diestel, [https://books.google.com/books?id=aR2TMYQr2CMC&pg=PA28 p. 28]; Harary, p. 10. 3. ^Bollobás, [https://books.google.com/books?id=SbZKSZ-1qrwC&pg=PA39 pp. 39–40]. 4. ^Gross (1998), [https://books.google.com/books?id=CRDMgj-DfdEC&pg=PA308 p. 308]. References
1 : Graph theory objects |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。