Dipole graph
Summary
In graph theory, a dipole graph, dipole, bond graph, or linkage, is a multigraph consisting of two vertices connected with a number of parallel edges. A dipole graph containing edges is called the size- dipole graph, and is denoted by . The size- dipole graph is dual to the cycle graph .
Further reading
- Wikipedia, page 6412575, revision 1258127794, Dipole graph. adopted
About this page
| Tag | SJVXZKVC58 |
|---|---|
| URI | m2://SJVXZKVC58 |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.