To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Replacement product

From Wikipedia, the free encyclopedia

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.[1]

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

  1. ^ Hoory, Shlomo; Linial, Nathan; Wigderson, Avi (7 August 2006). "Expander graphs and their applications". Bulletin of the American Mathematical Society. 43 (4): 439–562. doi:10.1090/S0273-0979-06-01126-8.

External links

This page was last edited on 27 April 2023, at 01:38
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.