Request New Subject
Home
Computer Science Engineering (CSE)
Discrete Mathematics
Q. Each edge has one end in set X and one end in set Y then the graph (X, Y) is called_____graph. (Solved)
1. bipartite
2. simple
3. complete
4. trivial
a. bipartite
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