Subdivided double
Summary
In graph theory, the subdivided double is a construction used to transform a 4-regular graph into a larger 4-regular graph. It consists of two steps: subdividing every edge into a path of two edges (with a new vertex in the middle of each path), and then replacing every vertex of the original graph with two copies, both adjacent to the same subdivision vertices. Potočnik, Verret, and Wilson use the notation to denote the subdivided double of a graph . It was named as the subdivided double earlier, by Potočnik and Wilson.
Further reading
- Wikipedia, page 83918691, revision 1369798712, Subdivided double. adopted
About this page
| Tag | MABH2V5AXR |
|---|---|
| URI | m2://MABH2V5AXR |
| 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.