Request New Subject
Home
Computer Science Engineering (CSE)
Discrete Mathematics
Q. Maximum number of edges in an n-node undirected graph without self loops is ____. (Solved)
1. [n(n-a)]/2
2. n-1
3. n
4. [n(n+a)]/2
a. [n(n-a)]/2
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe