Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
needed to be able to point to connected graph, so I created some minimum
I was going to add in the non-empty condition (I think that’s right, isn’t it?), but am getting that cookies editing problem and have to dash now.
Right, thanks. Added it.
Wouldn’t a more direct and more general definition be
A connected graph is an inhabited graph that cannot be decomposed as the disjoint union of two inhabited graphs.
If the graph is undirected then each pair of vertices is connected by a sequence of edges - every homset in its free category is inhabited.
if the graph is directed the decompositional definition is sometimes called weakly connected while the stronger homset definition can be called strongly connected or path connected.
These definitions only talk of graphs as structures. The article can then go on to talk about how these notions might be derived from connected objects in categories of graphs.
Please feel invited to expand the entry. I didn’t have any ambition to write an entry on connected graphs. I just wanted it to exist at all so that I could point to it.
I’ve edited connected graph to distinguish between strong and weak connectivity.
I’ve said nothing about how the notion of a strongly connected directed graph might have some definition from a category it appears in.
the strong definition doesn’t require that a graph be inhabited while the weak one does. I don’t know it this need be pointed out or resolved.
Thanks!
1 to 7 of 7