Mathematics · Graph Theory

10 शीर्षों (vertices) वाले एक साधारण अदिष्ट ग्राफ़ (simple undirected graph) पर विचार करें। यदि ग्राफ़ असंबद्ध (disconnected) है, तो इसमें अधिकतम कितनी भुजाएँ (edges) हो सकती हैं?

Verified Solution4 OptionsUpdated: October 2026👁️1 View

सही उत्तर देखें

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length Mathematics mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Graph Theory?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Mathematics · Graph Theory

The total number of edges in a regular graph with n vertices and degree d is given by:

बिना किसी सेल्फ़-लूप वाले n-शीर्ष (vertices) वाले एक साधारण अरास्तेदार (undirected) ग्राफ में अधिकतम कितनी भुजाएँ (edges) हो सकती हैं?

For a network with n devices connected in a fully connected mesh topology, the number of duplex physical links required is:

Related Practice Questions