In graph theory, are undirected graphs assumed to be reflexive? I know that in directed graphs vertices do not point to themselves unless explicitly stated, but what about undirected graphs?
2026-04-24 14:37:32.1777041452
In graph theory, are undirected graphs assumed to be reflexive?
971 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
In general, undirected graphs are not assumed to be reflexive. A lot of graph theory concerns "simple graphs", which are undirected and have no "loops", where a loop is an edge joining a vertex to itself. Unless the presence of loops is explicitly stated, I would assume they're not there.