Timeline for Name of an operation on graphs
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2010 at 10:25 | history | edited | Martin Rubey | CC BY-SA 2.5 |
added 91 characters in body
|
| Dec 14, 2010 at 9:37 | comment | added | Martin Rubey | Yes, I'm sure that in this section of the reference it's called "the product", and the union is called the union (sic!). The section is only 2 and a half pages, and is mostly concerned with the graph polynomial, where the problem of different vertex sets does not occur. | |
| Dec 14, 2010 at 7:01 | comment | added | Aaron Meyerowitz | @Martin are you sure? This operation seems to be defined only for two graphs $G$ and $H$ with the same vertex set. If one thinks of $G$ as having red edges and $H$ as having blue then it could be called the $"red-blue paths graph$ since each edge from $u$ to $v$ represents a path $uwv$ of that sort. | |
| Dec 13, 2010 at 22:52 | comment | added | Anthony Labarre | Thanks for the reference. I'm a bit reluctant to use the word "product", because of the many different uses for that term -- and the symbol's already taken too. However, what you quote seems most natural to me. I presume it wouldn't hurt to use that in a paper, as long as everything is stated and defined well enough to avoid confusion. | |
| Dec 13, 2010 at 22:35 | history | answered | Martin Rubey | CC BY-SA 2.5 |