Let G be the graph with vertices v_{1}, v_{2} and v_{3} and the matrix begi

Rui Baldwin 2021-08-17 Answered

Let G be the graph with vertices v1,v2 and v3 and the matrix [112101220]
To find the number of walks of from v1 to v3 we need to find matrix A2

You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Expert Answer

hajavaF
Answered 2021-08-18 Author has 90 answers

Step 1
A2=[112101220]×[112101220]
A2=[653332426]
The ijth element in matrix A2 represents the number of walks from vi to vj of length 2.
We can see from matrix A2 that the element a13 is 3. This implies that there are 3 walks of length 2 from v1 to v3

Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2021-08-02
Suppose that A is the set of sophomores at your school and B is the set of students in discrete mathematics at your school. Express each of these sets in terms of A and B.
a) the set of sophomores taking discrete mathematics in your school
b) the set of sophomores at your school who are not taking discrete mathematics
c) the set of students at your school who either are sophomores or are taking discrete mathematics
Use these symbols:
asked 2021-08-15
How many elements are in the set { 0, { { 0 } }?
asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2022-05-14
Prove based on functions
Prove that for all f , g N { 0 , 1 } there exist h N N bijection so:
f = g h f = g
My attempt was to assume that for all f , g N { 0 , 1 } there exist h N N bijection so: f = g h f g and try to get a contradiction without any succed.
asked 2021-08-03
To determine:
a) Using "Proof by Contraposition", show that: If n is any odd integer and m is any even integer, then, 3m3+2m2 is odd.
b) Using the Mathematical Induction to prove that: 32n1 is divisible by 4, whenever n is a positive integer.
asked 2022-05-23
Combinatorial proof of P r n + 1 = r ! + r ( P r 1 n + P r 1 n 1 + + P r 1 r ), where P r n denotes the number of r- permutations of an n element set.

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question