Register

self doubt

244 views
0 votes
0 votes
How much storage is needed to represent a simple graph with n vertices and m edges using

a) adjacency lists?

b) an adjacency matrix?

c) an incidence matrix?

Rosen_discrete_mathematics section 10.4 question 70.

thankyou.
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
farhan777 asked Apr 14
41 views
self doubt
how to check the validity of an a argument using laws of logics
how to check the validity of an a argument using laws of logics
User Avatar
0 votes
0 votes
1 answer
2
Çșȇ ʛấẗẻ asked Mar 20, 2023
396 views
self doubt
how to write if and only if symbolic form explain in detail????
how to write if and only if symbolic form explain in detail????
User Avatar
0 votes
0 votes
0 answers
3
curious mind asked Jan 1, 2023
323 views
Self Doubt
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?
User Avatar
3 votes
3 votes
1 answer
4
srestha asked Jun 4, 2019
995 views
Mathematical Logic Ques:Self doubt
“Not every satisfiable logic is valid” Representation of it will be $1)\sim \left ( \forall S(x)\rightarrow V(x) \right )$ or $2)\sim \left ( \forall S(x)\vee V(x) \right )$ Among $1)$ and $2)$, which one is correct? and why?
“Not every satisfiable logic is valid” Representation of it will be $1)\sim \left ( \forall S(x)\rightarrow V(x) \right )$or$2)\sim \left ( \forall S(x)\vee V(x) \rig...
User Avatar
Link Copied!