If you study graphs in which edges can link more than two nodes, you're more properly called a hyperedgelord.