Login

Search the forums now!

Welcome, Guest. Please login or register.

November 01, 2025, 10:45:03 am
Pages: [1]   Go Down

Author Topic: Networks-connected graph  (Read 659 times)  Share 

0 Members and 1 Guest are viewing this topic.

LFTM

  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1072
  • Respect: +1
Networks-connected graph
« on: October 23, 2010, 12:33:24 pm »
0
How do i identify a connected graph using an adjacency matrix? (question 9 in exam 1 of 2003 exam)
Also, what is a connected graph? i don't really get the definition in the essentials book.
Logged

crayolé

  • Victorian
  • Forum Leader
  • ****
  • Posts: 788
  • Respect: +3
Re: Networks-connected graph
« Reply #1 on: October 23, 2010, 12:43:57 pm »
0
A connected graph is when all vertices have a path to every other vertex.mBasically, as long as there arent any vertices on their own - your graph is connected.

An adjacency matrix shows you which vertices are joined by edges [0 meaning there's no edges between them]. So, if a matrix had a row/column full of zero's, that means it's not joined to any other vertex and other vertexes aren't joined to it. Therefore it's on its own, therefore not every point can be reached from another therefor it's not connected
Logged
Pages: [1]   Go Up