Hindi
English

Question

Download Solution PDF

यदि G एक फॉरेस्ट है जिसमें n वर्टेक्स हैं तथा K संयुक्त घटक (कनेक्टेड कम्पोनेंट्स) हैं, तो G के कितने किनारे हैं?

This question was previously asked in
HTET PGT Official Computer Science Paper - 2017
Download PDF Attempt in App
View all HTET Papers >
  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
60 Qs. 60 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

संकल्पना:

  • ट्री का समूह और कुछ नहीं बल्कि फॉरेस्ट है।


व्याख्या:

उदाहरण:

  • उपरोक्त ग्राफ G में 3 ट्रेस, k=3 और कुल 6 नोड्स, n=6 हैं, इसलिए यदि हम n से k घटाते हैं तो हमें किनारों की संख्या 3 के बराबर मिलेगी।
  • किनारों की कुल संख्या प्राप्त करने का सामान्य सूत्र होगा n - k


अतः विकल्प 2 सही उत्तर है।

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.

Exams Tests Super Practice

More Graphs Questions

Q1.अनिर्देशित आलेख के लिए निम्नलिखित में से कौन सा/से कथन सत्य है?
Q2.Arrange the following graph on the basis of number of edges in increasing order [for n > 3] A. Kn (Complete Graph) B. Cn (Cycle graph) C. Wn (Wheel graph) D. Kn, n (Complete Bipartite Graphs) E. Qn (n-cubes graph) 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?

More Graph Theory Questions

Q1.अनिर्देशित आलेख के लिए निम्नलिखित में से कौन सा/से कथन सत्य है?
Q2.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q3.Which of the following Graph is/are planer? Choose the most appropriate answer from the options given below:
Q4.Arrange the following graph on the basis of number of edges in increasing order [for n > 3] A. Kn (Complete Graph) B. Cn (Cycle graph) C. Wn (Wheel graph) D. Kn, n (Complete Bipartite Graphs) E. Qn (n-cubes graph) Choose the correct answer from the options given below:
Q5.निम्नलिखित में से कौन से ग्राफ़ ट्री हैं? A. B. C. D. निम्नलिखित विकल्पों में से सही उत्तर चुनिए:
Q6.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:
Q7.सूची I को सूची II से सुमेलित कीजिए: सूची - I सूची - II A. प्लैनर ग्राफ I. प्रायिकतात्मक मॉडल B. बाइपार्टाइट ग्राफ II. नियतात्मक मॉडल C. PERT III. 4-रंगनीय D. CPM IV. 2-रंगनीय निम्नलिखित विकल्पों में से सही उत्तर चुनिए:
Q8.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.
Q9.एक प्रधान नोड क्या होता है?
Q10.स्टार से जुड़ा नेटवर्क 20 किलोवाट की शक्ति और शक्ति-कारक 0.8 का उपयोग करता है। 230 वोल्ट, 50 हर्ट्ज की आपूर्ति वोल्टेज पर प्रत्येक कॉयल के प्रतिरोध के मान की गणना करें।
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

HTET TGT Important Links

ResultAdmit CardAnswer KeyEligibility CriteriaBooksSyllabus and Exam Pattern

More Engineering Mathematics Questions

Q1.यदि L = {1, 2, 3, 4, 6, 9, 36} जालक है, तो नीचे दिए गए हैस आरेख में 9 के पूरकों की संख्या ज्ञात कीजिए।
Q2.अनिर्देशित आलेख के लिए निम्नलिखित में से कौन सा/से कथन सत्य है?
Q3.\(\iint \frac{x y}{\sqrt{1-y^{2}}} d x d y\) Over the positive quadrant of the circle x2 + y2 = 1 is __________.
Q4.The real root of the equation x3 − x − 5 = 0 lying between 1 and 2 after first iteration by Newton-Raphson method is ________, if initial approximation is taken as x0 = 2 ∈ [1, 2] : 
Q5.Let X be uniform random variable on [0, 4] and Y be uniform random variable on [0, 1]. If X and Y are independent, then P(max {X, Y} > 3) is equal to : 
Q6.If R and D are the radius and diameter of the graph K4,7, then the ordered pair (R, D) is equal to : 
Q7.The largest number of faces in a simple connected maximal planar graph with 100 vertices is :
Q8.If for the matrix A, A3 = I then A−1 = __________. 
Q9.Energy of power signal is : 
Q10.With usual notations, the properties of maxima and minima under various conditions are __________. I II (P) Maxima (i) r t− s2 = 0 (Q) Minima (ii) rt − s2 < 0 (R) Saddle Point (iii) rt − s2 > 0, r > 0 (S)  Case of failure (iv) rt − s2 > 0, r < 0
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
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
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： real cash teen patti teen patti lotus teen patti diya teen patti jodi teen patti fun