2 papers
math.CO2024
Intrinsically knotted graphs and connected domination
Gregory Li, Andrei Pavelescu, Elena Pavelescu
We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination…
math.CO2024
Connected Domination in Plane Triangulations
Felicity Bryant, Elena Pavelescu
A set of vertices of a graph such that each vertex of is either in the set or is adjacent to a vertex in the set is called a dominating set of . If additionally, the set…