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
Posted: Thu Jul 14, 2022 9:05 am
a) (m+n)4>=mn
b) m≤5/3(n−2)
c) (m2+n)/3
d) n>=(6/5)(n+1)
b) m≤5/3(n−2)
c) (m2+n)/3
d) n>=(6/5)(n+1)