Suppose G be a connected planar graph of order n≥5 and size m. If t – McqOptions

MCQOPTIONS

1.	Suppose G be a connected planar graph of order n≥5 and size m. If the length of the smallest cycle in G is 5, then which of the following is true?
A.	(m+n)4>=mn
B.	m≤5/3(n−2)
C.	(m2+n)/3
D.	n>=(6/5)(n+1)
Answer» C. (m2+n)/3

Discussion

No Comment Found

Related MCQs

A non-planar graph can have ____________
What is the number of edges of the greatest planar subgraph of K3,2 where m,n≤3?
Suppose G be a connected planar graph of order n≥5 and size m. If the length of the smallest cycle in G is 5, then which of the following is true?
For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing a planar representation of the graph?
If the number of vertices of a chromatic polynomial PG is 56, what is the degree of PG?
Determine the density of a planar graph with 34 edges and 13 nodes.
If Cn is the nth cyclic graph, where n>3 and n is odd. Determine the value of X(Cn).
If a graph G is k-colorable and k<n, for any integer n then it is ___________
The chromatic number of a graph is the property of ____________