1 paper
Amitava Bhattacharya, Aloysius Godinho, Pritam Majumder +1
In this paper we consider the problem to reconstruct a k-uniform hypergraph from its line graph. In general this problem is hard. We solve this problem when the number of hypered…