Computer Science · Graph Theory
एक दिष्ट ग्राफ़ (Digraph) जिसमें कोई स्व-लूप (Self-loop) या समानांतर किनारे (Parallel edges) नहीं होते हैं, कहलाता है _________________।
- 1नियमित दिष्ट ग्राफ़ (Regular Digraph)
- 2पूर्ण दिष्ट ग्राफ़ (Complete Digraph)
- 3द्वि-दिष्ट ग्राफ़ (Bi-Digraph)
- 4सरल दिष्ट ग्राफ़ (Simple Digraph)✓
सही उत्तर देखें
सरल दिष्ट ग्राफ़ (Simple Digraph)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory