Learn More
Akers et al. proposed the split-star as an alternative to the star graph which can be viewed as a companion graph of An. All of these graphs have maximal connectivity. In this paper, we study these interconnection topologies using advanced measures of vulnerability, namely, strength and toughness. Moreover, we show that with respect to toughness, a star(More)
A time-stamped graph is an undirected graph with a real number on each edge. Vertex u innuences vertex v if there is a non-decreasing path from u to v. The associated innuence digraph of a time-stamped graph is the directed graph that records the innuences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated(More)