Register

graph Theory

430 views
1 votes
1 votes
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 and |b-d|<=1.
The number of edges in this graph is __________.
User Avatar

1 Answer

0 votes
0 votes
Answer is 506 edges in graph
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
suryansh rajput asked Oct 2, 2023
198 views
Graph Theory
User Avatar
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
189 views
Graph theory self doubt
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
User Avatar
3 votes
3 votes
0 answers
3
Kabir5454 asked Jan 2, 2023
449 views
graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?
User Avatar
0 votes
0 votes
0 answers
4
AngshukN asked May 22, 2022
404 views
Introduction to Graph Theory Exercises
This is the problem snapshot
This is the problem snapshot
User Avatar
Link Copied!