105 citations · 133 across the 6 of their papers we have counts for
6 papers
On the class reconstruction number of trees
Ilia Krasikov, Yehuda Roditty, Bhalchandra D. Thatte
Harary and Lauri conjectured that the class reconstruction number of trees is 2, that is, each tree has two unlabelled vertex-deleted subtrees that are not both in the deck of any…
Line-Broadcasting in Complete k-Trees
Revital Hollander Shabtai, Yehuda Roditty
A line-broadcasting model in a connected graph , , is a model in which one vertex, called the {\it originator} of the broadcast holds a message that has to be trans…
Efficient construction of broadcast graphs
A. Averbuch, R. Hollander Shabtai, Y. Roditty
A broadcast graph is a connected graph, , , in which each vertex can complete broadcasting of one message within at most time units. A min…
Anti-Ramsey numbers of graphs with small connected components
Shoni Gilboa, Yehuda Roditty
The anti-Ramsey number, , for a graph and an integer , is defined to be the minimal integer such that in any edge-colouring of by at least c…
Anti-Ramsey numbers of small graphs
Arie Bialostocki, Shoni Gilboa, Yehuda Roditty
The anti-Ramsey number ), for a graph and an integer , is defined to be the minimal integer such that in any edge-colouring of by at least co…
Dense graphs are antimagic
N. Alon, G. Kaplan, A. Lev +2
An {\em antimagic labeling} of a graph with edges and vertices is a bijection from the set of edges to the integers such that all vertex sums are pairwise dis…