Awesome q2a theme
0 votes
14 views
Find the number of paths of length n between any two nonadjacent vertices in K3,3 for the following values of n:

a)2  b)3. c)4. d)5

 ( i am able to understand the number of paths of length n between any two adjacent vertices in K3,3… but i am not able to get intuition for non adjacent in the adjacency matrix)
in Graph Theory by (5 points) | 14 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,270 questions
3,204 answers
14,751 comments
96,304 users