\(^{n}C_2\) को graph के edges से जोड़ें तो इसका क्या अर्थ है?

If \(^{n}C_2\) is connected with edges of a graph what does it mean?

Explanation opens after your attempt
Correct Answer

A. (n) vertices में unordered pair of vertices की संख्याNumber of unordered pairs of vertices among (n) vertices

Step 1

Concept

An edge is formed by an unordered pair of two vertices. In exams use \(^{n}C_2\) for pairs without direction.

Step 2

Why this answer is correct

The correct answer is A. (n) vertices में unordered pair of vertices की संख्या / Number of unordered pairs of vertices among (n) vertices. An edge is formed by an unordered pair of two vertices. In exams use \(^{n}C_2\) for pairs without direction.

Step 3

Exam Tip

एक edge दो vertices के unordered pair से बनता है। परीक्षा में pair without direction के लिए \(^{n}C_2\) लगाएँ।

Question me issue ya doubt hai?

Answer, explanation, typing mistake ya suggestion directly hamari team ko bhejein. 📱Helpline (Call / WhatsApp): +91 7272824365

Related Mathematics Questions

FAQs

Mathematics Answer, Explanation and Revision Hints

\(^{n}C_2\) को graph के edges से जोड़ें तो इसका क्या अर्थ है? / If \(^{n}C_2\) is connected with edges of a graph what does it mean?

Correct Answer: A. (n) vertices में unordered pair of vertices की संख्या / Number of unordered pairs of vertices among (n) vertices. Explanation: एक edge दो vertices के unordered pair से बनता है। परीक्षा में pair without direction के लिए \(^{n}C_2\) लगाएँ। / An edge is formed by an unordered pair of two vertices. In exams use \(^{n}C_2\) for pairs without direction.

Which concept should I revise for this Mathematics MCQ?

An edge is formed by an unordered pair of two vertices. In exams use \(^{n}C_2\) for pairs without direction.

What exam hint can help solve this Mathematics question?

एक edge दो vertices के unordered pair से बनता है। परीक्षा में pair without direction के लिए \(^{n}C_2\) लगाएँ।