Register

kenneth rosen

380 views
0 0 votes
complete m arry tree is full m arry tree and vice versa

is it true?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · doubt reccurrence r...Next → · c programming
← Previous in category · kenneth rosenNext in category → · keneth rosen
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
BASANT KUMAR asked Oct 20, 2018
1,217 views
graph theory(basic doubt,kenneth rosen)
Q.1) for which value of n are these graph are bipartite??a)$C_{N}$ (cycle graph having "n" vertices)(b) $W_{N}$ (wheel graph having "n" vertices)
1 1 vote
0 0 answers
700
700 views
CJ147 asked Aug 25, 2018
700 views
Kenneth Rosen Discrete Mathematics
DIRAC’S THEOREM: If G is a simple graph with n vertices with n ≥ 3 such that the degree of every vertex in G is at least n/2, then G has a Hamilton circuit.The below grap...
1 1 vote
1 1 answer
1.6k
1.6k views
saurab asked Aug 4, 2018
1,569 views
Kenneth Rosen Edition 6th Exercise 8.4 Question 6 (Page No. 574)
how many connected components does the following graph has ?find its connected component ?
0 0 votes
0 0 answers
379
379 views
eyeamgj asked Jul 8, 2018
379 views
kenneth rosen
Given n+1 symbols x1,x2,...,xn,xn+1 appearing 1, f1,f2,...,fn times in a symbol string, respectively, where fj is the jth Fibonacci number, what is the maximum number of ...