If every node u in G is adjacent to every other node v in G, A graph is said to be Options: A . &nbspIsolated B . &nbspComplete C . &nbspFinite D . &nbspStrongly connected

If every node u in G is adjacent to every other node v in G, A graph is said to

Question

If every node u in G is adjacent to every other node v in G, A graph is said to be

Options:

A . Isolated

B . Complete

C . Finite

D . Strongly connected

Answer: Option B

Submit Your Solution Below and Earn Points !

Next Question

Question 1. Two dimensional arrays are also called....

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0