Timeline for Hamming graphs and power series
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2012 at 17:08 | comment | added | Gerhard Paseman | A comment on the more general case: one can parition an arbitrary connected graph into sets I, J and K, and sum over each siet for a given i and j. I'll let professionals such as Brendan McKay tell you how much further you can run with such a set up. Gerhard "Ask Me About System Design" Paseman, 2012.01.27 | |
| Jan 27, 2012 at 16:58 | comment | added | Gerhard Paseman | Play with it. For starters, take a complete bipartite graph K_n,m and remove all edges from j except the one connecting to i. After looking at that, start adding edges one at a time to j, and see what you get. Good luck. Gerhard "Ask Me About System Design" Paseman, 2012.01.27 | |
| Jan 27, 2012 at 16:55 | comment | added | Michele | Many thanks. I wonder what kind of properties one could invoke here. Some form of distance-regularity? | |
| Jan 27, 2012 at 16:50 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Jan 27, 2012 at 16:44 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |