If you have a graph with 1 node and no edges and you then remove this 1 node, is the remaining a graph with 0 nodes or is it not anymore a graph?
Alternative formulation:
Is there something such as a empty null graph?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityIf you have a graph with 1 node and no edges and you then remove this 1 node, is the remaining a graph with 0 nodes or is it not anymore a graph?
Alternative formulation:
Is there something such as a empty null graph?
This is not quite clear. There is an entire paper dedicated to this question.
'Is the null-graph a pointless concept?' by Frank Harary and Ronald C. Read
Its abstract says (my emphasis):
The graph with no points and no lines is discussed critically. Arguments for and against its official admittance as a graph are presented. This is accompanied by an extensive survey of the literature. Paradoxical properties of the null-graph are noted. No conclusion is reached.
Yes, there is such a thing. A graph with zero nodes is generally referred to as the null graph. The term empty graph usually refers to a graph with no edges (but possibly some nodes).
Googling these terms will yield some non-trivial results.
An empty graph might or might not have $0$ nodes. What you are talking about is the empty graph with $0$ nodes. It does exist.