Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More
English
Hindi

Question

Download Solution PDF

If G is a forest with n vertices and K connected components, then how many edges does G have?

This question was previously asked in
HTET PGT Official Computer Science Paper - 2017
Download PDF Attempt Online
View all HTET Papers >
  1. \(\left\lfloor {n/K} \right\rfloor\)
  2. n - K
  3. n - K + 1
  4. n - K - 1

Answer (Detailed Solution Below)

Option 2 : n - K
Free Tests
View all Free tests >
Free
HTET PGT Official Computer Science Paper - 2019
4.5 K Users
60 Questions 60 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

Concept:

  • A group of trees is nothing but forest.


Explanation:

Example:

F1 Raju.S 22-07-2020 Savita D4

  • In above graph G there are 3 tress, k=3 and total 6 nodes, n=6 so if we subtract k from n then we will get number of edges equal to 3.
  • General formula to get total number of edges will be n – k


Hence option 2 is the correct answer.

Download Solution PDF
Latest HTET Updates

Last updated on Jul 12, 2025

-> HTET Exam Date is out. HTET Level 1 and 2 Exam will be conducted on 31st July 2025 and Level 3 on 30 July

-> Candidates with a bachelor's degree and B.Ed. or equivalent qualification can apply for this recruitment.

-> The validity duration of certificates pertaining to passing Haryana TET has been extended for a lifetime.

-> Enhance your exam preparation with the HTET Previous Year Papers.

More Graphs Questions

Q1.Which of the following statements is/are TRUE for undirected graphs?
Q2.Which of the following graphs are trees ?  A.  B.  C.  D.  Choose the correct answer from the options given below :  
Q3.Statement 1: Given a graph G = (V, E) in which each vertex v ∈ V has an associated positive weight w(v), we can use linear programming to find the lower bound on the weight of the minimum-weight vertex cover. Statement 2: The lower bound can be found by maximizing the following \(\rm\sum_{v \in V}^n {w}(v) {x}(v)\) subject to x(u) + x(v) ≥ 1 for each (u, v) ∈ V x(v) ≤ 1 for each v ∈ V x(v) ≥ 0 for each v ∈ V In the light of the above statements, choose the most appropriate answer from the options given below:
Q4.Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices of Euler graph are of even degree. R: Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one. S: There exits a bipartite graph with more than ten vertices which is 2-colorable. What is the number of correct statements among the above statements.
Q5.Which of the following properties of the circuits of a graph are correct? 1. The minimum number of branches possible in a circuit will be equal to the number of elements in a circuit. 2. There are exactly two paths between any pair of vertices in a circuit. 3. There are at least two branches in a circuit. Select the correct answer using the code given below.
Q6.Given below are two statements Statement I : In an undirected graph, number of odd degree vertices is even. Statement II : In an undirected graph, sum of degrees of all vertices is even. In light of the above statements, choose the correct answer from the options given below.
Q7.For which value of n is Wheel graph Wn regular?
Q8.Which of the properties hold for the adjacency matrix A of a simple undirected unweighted graph having n vertices?
Q9.The following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are TRUE?
Q10.Consider a simple undirected unweighted graph with at least three vertices. If A is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of

More Graph Theory Questions

Q1.Which of the following statements is/are TRUE for undirected graphs?
Q2.Which of the following graphs are trees ?  A.  B.  C.  D.  Choose the correct answer from the options given below :  
Q3.Statement 1: Given a graph G = (V, E) in which each vertex v ∈ V has an associated positive weight w(v), we can use linear programming to find the lower bound on the weight of the minimum-weight vertex cover. Statement 2: The lower bound can be found by maximizing the following \(\rm\sum_{v \in V}^n {w}(v) {x}(v)\) subject to x(u) + x(v) ≥ 1 for each (u, v) ∈ V x(v) ≤ 1 for each v ∈ V x(v) ≥ 0 for each v ∈ V In the light of the above statements, choose the most appropriate answer from the options given below:
Q4.Match List I with List II LIST - I LIST - II A. Planar Graph I. Probabilistic Model B. Bipartite Graph II. Deterministic Model C. PERT III. 4-Colorable D. CPM IV. 2-Colorable Choose the correct answer from the options given below:
Q5.Consider the following statements: P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges. Q: All vertices of Euler graph are of even degree. R: Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one. S: There exits a bipartite graph with more than ten vertices which is 2-colorable. What is the number of correct statements among the above statements.
Q6.A principal node is a
Q7.A star connected network consumes a power of 20 kW with a power factor of 0.8. Calculate the value of resistance of each coil when a supply voltage of 230 volts and 50 Hz is supplied between two phases of the network.
Q8.Which of the following properties of the circuits of a graph are correct? 1. The minimum number of branches possible in a circuit will be equal to the number of elements in a circuit. 2. There are exactly two paths between any pair of vertices in a circuit. 3. There are at least two branches in a circuit. Select the correct answer using the code given below.
Q9.A path is a particular subgraph consisting of an ordered sequence of branches having which of the following properties? 1. At all but two of its nodes, called internal nodes, there are incident exactly two branches of the subgraph. 2. At each of the remaining two nodes, called terminal nodes, there is incident exactly one branch of the subgraph. Select the correct answer using the code given below.
Q10.Given below are two statements Statement I : In an undirected graph, number of odd degree vertices is even. Statement II : In an undirected graph, sum of degrees of all vertices is even. In light of the above statements, choose the correct answer from the options given below.
Crack Super Pass Live with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
HTET TGT Level 2 - 2024 Mock Test
183 Total Tests with 3 Free Tests
Start Free Test
Pedagogy for All Teaching Exams (Paper 1 & 2) - Let's Crack TET!
345 Total Tests with   3 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
HTET TGT

HTET TGT Important Links

More Engineering Mathematics Questions

Q1.If L = {1, 2, 3, 4, 6, 9, 36} is the lattice find the number of complements 9 is having in the below given Hasse diagram?
Q2.Which of the following statements is/are TRUE for undirected graphs?
Q3.A flip-flop is used to store the ____________.
Q4.Let \(\rm \begin{pmatrix}2&a\\\ b&c\end{pmatrix}\) be a 2 x 2 real matrix for which 6 is an eigenvalue. Which of the following statements is necessarily true?
Q5.If the value of the approximate solution of the initial value problem   \(\rm \left\{\begin{matrix}y'(x)=x(y(x)+1), &x\in R\\\ y(0)=β \end{matrix}\right.\) at x = 0.2 using the forward Euler method with step size 0.1 is 1.02, then the value of β is 
Q6.The system of linear equations 3x – 2y – kz = 10 2x – 4y – 2z = 6 x + 2y – z = 5m is inconsistent if :
Q7.The statement among the following that is a tautology is:
Q8.The logical statement (p ⇒ q) ∧ (q ⇒∼ p) is equivalent to
Q9.An unbiased coin is tossed 5 times. Suppose that a variable X is assigned the value k when k consecutive heads are obtained for k = 3, 4, 5, otherwise 𝑋 takes the value -1. The expected value of X, is
Q10.For the statements p and q, consider the following compound statements: (a) (~q∧(p → q)) → ~p (b) ((p∨q))∧~p) → q Then which of the following statements is correct?
Important Exams
Super Coaching
Exams
Test Series
Previous Year Papers
Objective Questions
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti apk teen patti apk download teen patti tiger teen patti plus