a connected graph is a graph wherein path exists


A connected graph is a graph wherein path exists among every pair of vertices.

A strongly connected graph is a directed graph wherein every pair of distinct vertices is connected along with each other.

A weakly connected graph is a directed graph wherein underlying graph is connected, although not strongly connected.

A complete graph is a graph wherein there exists edge among every pair of vertices.

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: a connected graph is a graph wherein path exists
Reference No:- TGS0413841

Expected delivery within 24 Hours