2 papers
math.CO2023
Local Antimagic Coloring of Some Graphs
Ravindra Pawar, Tarkeshwar Singh, Adarsh Handa +1
Given a graph , a bijection is called a local antimagic labeling of if the vertex weight is dist…
math.CO2021
Reconstruction of hypergraphs from line graphs and degree sequences
Amitava Bhattacharya, Aloysius Godinho, Pritam Majumder +1
In this paper we consider the problem to reconstruct a -uniform hypergraph from its line graph. In general this problem is hard. We solve this problem when the number of hypered…