Timeline for Weighted Regular Graphs
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2010 at 13:17 | comment | added | Dave Pritchard | The same holds between regular graphs with some loops (loops contribute 1 to degree) and their weighted counterparts: going <=, when you clone a node v with a loop, connect each clone of v to each clone of v (including one loop per clone). The => quotient operation: given a regular graph G with loops, define u ~ v if neighbours(u)=neighbours(v) [a loop at u implies u in neighbours(u)]. ~ is an equivalence relation. Then, if R is any equivalence relation refining ~, the graph G/R (identify classes of R, delete || edges) is weighted-regular graph with loops; all can be obtained in this way. | |
| May 6, 2010 at 12:48 | history | edited | Dave Pritchard | CC BY-SA 2.5 |
edited body
|
| May 6, 2010 at 12:43 | history | answered | Dave Pritchard | CC BY-SA 2.5 |