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

"Edgelord", by Randall Munroe, licensed under Creative Commons Attribution-NonCommercial 2.5 License

Alt Text

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