connected component of a graph (Q2997928)

From Wikidata
Jump to navigation Jump to search
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path
edit
Language Label Description Also known as
English
connected component of a graph
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path

    Statements

    Identifiers