Not signed in (Sign In)

Start a new discussion

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Discussion Tag Cloud

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorUrs
    • CommentTimeJan 17th 2018

    needed to be able to point to connected graph, so I created some minimum

    • CommentRowNumber2.
    • CommentAuthorDavid_Corfield
    • CommentTimeJan 17th 2018

    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.

    • CommentRowNumber3.
    • CommentAuthorUrs
    • CommentTimeJan 17th 2018

    Right, thanks. Added it.

    • CommentRowNumber4.
    • CommentAuthorRodMcGuire
    • CommentTimeJan 17th 2018

    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.

    • CommentRowNumber5.
    • CommentAuthorUrs
    • CommentTimeJan 17th 2018
    • (edited Jan 17th 2018)

    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.

    • CommentRowNumber6.
    • CommentAuthorRodMcGuire
    • CommentTimeJan 18th 2018

    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.

    • CommentRowNumber7.
    • CommentAuthorUrs
    • CommentTimeJan 18th 2018

    Thanks!

Add your comments
  • Please log in or leave your comment as a "guest post". If commenting as a "guest", please include your name in the message as a courtesy. Note: only certain categories allow guest posts.
  • To produce a hyperlink to an nLab entry, simply put double square brackets around its name, e.g. [[category]]. To use (La)TeX mathematics in your post, make sure Markdown+Itex is selected below and put your mathematics between dollar signs as usual. Only a subset of the usual TeX math commands are accepted: see here for a list.

  • (Help)