Hey..!!

(e) in L(G) for each edge e in G.· For any two edges e and e' in G, L(G) has an edge between v

(e) and v

(e'), if and only if e and e' are incident with the same vertex in G.Which of the following statements is/are TRUE?(P) The line graph of a cycle is acycle.

(Q) The line graph of a clique is aclique.

(R) The line graph of a planar graph isplanar.

(S) The line graph of a tree is a tree

A Foxoyo User

- Level 0
- 0 %

Accuracy -

share

The line graph L(G) of a simple graph G is defined as follow

Directions

(26-30): In these questions, relationship between

(26-30): In these questions, relationship between

What will be the output of the program

class Tree { }

class

class Tree { }

class

A person wants to visit someplaces.

He starts from a vertex

He starts from a vertex

Statements: All birds aretall.

Some tall arehens.

Conclusi

There is a regular octagon A B C D E F G, a Frog is at the v

Which two statements are true about comparing two instances

U, V, W, X, Y and Z are six police officers, who are paradin

The height of a tree is defined as the number of edges on th

Five farmers have 7,9,11,13 & 14 apple trees respectively in