Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

To sketch the graph of a polar equation a good first step is to sketch the graph in the Cartesian coordinate system. This will give a way to visualize how r changes with θ. The information about how r ...

Graphs of Sine and Cosine 1.2 An applet illustrating how the graphs of sine and cosine are related to the unit circle. Transformations of Functions 1.3 An applet illustrating how transformations ...

A set of vertices S of a connected graph G is a nonseparating independent set if S is independent and G–S is connected. The nsis number 𝒵(G) is the maximum cardinality of a nonseparating independent ...