# Welcome to the Tree Properties MCQs Page

Dive deep into the fascinating world of Tree Properties with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Tree Properties, a crucial aspect of Discrete Mathematics. In this section, you will encounter a diverse range of MCQs that cover various aspects of Tree Properties, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Discrete Mathematics.

Check out the MCQs below to embark on an enriching journey through Tree Properties. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Discrete Mathematics.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Tree Properties. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

### Tree Properties MCQs | Page 1 of 6

Q1.
An undirected graph G which is connected and acyclic is called ____________
Q2.
An n-vertex graph has ______ edges.
Q3.
What is a star tree?
Answer: (a).A tree having a single internal vertex and n-1 leaves
Q4.
A polytree is called _______________
Q5.
The tree elements are called __________
Q6.
In an n-ary tree, each vertex has at most ______ children.
Q7.
A linear graph consists of vertices arranged in a line.
Q8.
Two labeled trees are isomorphic if ____________
Answer: (c).graphs of the two trees are isomorphic and the two trees have the same label
Q9.
A graph which consists of disjoint union of trees is called ______