Recent content by beddytear

still lost. if i pick 2 vertices...? 3 vertices?

Given a subset X of the vertices of G, the cut induced by X is the set of edges that have exactly one end in X. Maybe the theorem: A graph G is not connected if and only if there exists a proper nonempty subset X of V(G) such that the cut induced by X is empty helps?

Homework Statement Let G be a graph with at least two vertices, such that the cut induced by every proper nonempty subset of vertices of G contains exactly two elements. Determine (with proof ) the number of vertices and edges in G. Homework Equations Connectedness. A graph G is...

Hi. I'm really struggling with this generating function problem. Any help would be greatly appreciated. Question: Find the generating function for the compositions (c1,c2,c3...,ck) such that for each i, ci is an odd integer at least 2i-1. Second part of question: Use the above...