Combinatorial Number Theory: "Association Times For Graphs"
A graph parameter has been defined by Benjamini, Shinkar and Tsur as the association time by having vertices in G be aquatinted if they are adjacent. A matching is then used to swap vertices within the graph, and they are now associated with the new vertices they are adjacent to. The acquaintance time of the graph is the how many matchings must be consecutively applied until every vertex is associated with the rest of the graph. Examples of basic graphs will be given and some results for the bounds… Show more
900 University Ave.
Riverside, CA 92521
Don't Miss This
$16 Spring/Summer Blue Whale Watching Cruise Special
at California Whale Watching-Newport LandingFri 9/19 10:00a
Hot Tickets More »
ON SALE NOW
Sat 10/11 8:00p
Sun 9/28 3:00p
Sun 9/21 3:00p