Request New Subject
Home
Computer Science Engineering (CSE)
Data Structure and Algorithms (DSA)
Q. If every node u in G is adjacent to every other node v in G, A graph is said to be (Solved)
1. Isolated
2. Complete
3. Finite
4. Strongly connected
b. Complete
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
→ CPP Programming
Subscribe Now
Get All Updates & News
Subscribe