Register

kenneth rosen

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

is it true?
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
1 answer
1
BASANT KUMAR asked Oct 20, 2018
552 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)
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)
User Avatar
1 votes
1 votes
0 answers
2
CJ147 asked Aug 25, 2018
458 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 graph does not follow the above rule but still have a Hamilton circuit.
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 ...
User Avatar
1 votes
1 votes
1 answer
3
saurab asked Aug 4, 2018
979 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 ?
how many connected components does the following graph has ?find its connected component ?
User Avatar
Link Copied!