- Source: Replacement product
In graph theory, the replacement product of two graphs is a graph product that can be used to reduce the degree of a graph while maintaining its connectivity.
Suppose G is a d-regular graph and H is an e-regular graph with vertex set {0, …, d – 1}. Let R denote the replacement product of G and H. The vertex set of R is the Cartesian product V(G) × V(H). For each vertex u in V(G) and for each edge (i, j) in E(H), the vertex (u, i) is adjacent to (u, j) in R. Furthermore, for each edge (u, v) in E(G), if v is the ith neighbor of u and u is the jth neighbor of v, the vertex (u, i) is adjacent to (v, j) in R.
If H is an e-regular graph, then R is an (e + 1)-regular graph.
References
External links
Trevisan, Luca (7 March 2011). "CS359G Lecture 17: The Zig-Zag Product". Retrieved 16 December 2014.
Kata Kunci Pencarian:
- Produk nasional bersih
- Daftar perangkat iOS
- Larutan ringer laktat
- Noretisteron
- Negara Islam Irak dan Syam
- Moskow
- Steam
- California
- Sosialisme
- Inventarisasi hutan di Indonesia
- Replacement product
- Nicotine replacement therapy
- Nicorette
- Soylent (meal replacement)
- Meal replacement
- Pancreatic enzymes (medication)
- Tissue engineering
- Hip replacement
- Planned obsolescence
- Bodybuilding supplement
Fitzcarraldo (1982)
Ghostbusters II (1989)
No More Posts Available.
No more pages to load.