Math Dept. Overview Overview Mission Faculty and Staff Faculty Positions News and Events Awards Major Minors Student Organizations
Placement Choosing First Course
Advising Freshman Fall 2011 or After All Other Years
Undergraduate Research Overview Student Resources Faculty Resources Capstone Projects News and Events Additional Resources
Arts and Sciences Dept. Listing Other Departments

The $r$-reduced Cutting Numbers of Cycles, Sequences of Cycles and Graphs Dr. Brad Bailey* and Dr. Dianna Spence, North Georgia College & State University Mathematics Department


In this talk, we define the $r$-reduced cutting number of a cycle $C$ within graph $G$ to be the number of components in $G-E(C)$ with order at least $r$. Then the $r$-reduced cutting number of $G$ is the maximum of the $r$-reduced cutting number over all possible cycles in $G$. We determine the maximum and minimum number of edges in a graph with $n$ vertices and $r$-reduced cutting number $k$. We also define the $r$-reduced cutting number for an edge-wise disjoint sequence of cycles in a graph. Then the cutting power (at level $r$) of a graph is the shortest such sequence which has $r$-reduced cutting number at least 2.
View of the clock tower
A-Z Sitewide Index
About the site
Georgia College • 231 W. Hancock St. • Milledgeville, GA 31061 • 1-800-342-0471 ; Admissions: 478-445-2774 •