Home/ Questions/Q 633995
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-13T20:14:46+00:00

Is there a term to describe a graph who has only one subgraph that

  • 0

Is there a term to describe a graph who has only one subgraph that is strongly connected? (I’m not even sure I’m using strongly connected correctly here).

eg. {AB,BC} has only one subgraph and {AB,BC,DE} has two.

Note that I’m not considering that the graph {AB,BC} has three subgraphs: {AB,BC} and {AB} and {BC}.

please distinguish between undirected and directed if need be.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I think you mean a connected graph, the alternative being a forest disconnected graph.

    From http://en.wikipedia.org/wiki/Connectivity_%28graph_theory%29 —

    A graph is called connected if every pair of distinct vertices in the graph can be connected through some path. A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph. It is connected if it contains a directed path from u to v or a directed path from v to u for every pair of vertices u,v. It is strongly connected or strong if it contains a directed path from u to v and a directed path from v to u for every pair of vertices u,v. The strong components are the maximal strongly connected subgraphs.

    • 0