On the number of cut edges in a regular graph.
Nirmala Achuthan, A. Ramachandra Rao · 2003
A cut edge in a graph G is an edge whose removal increases the number of connected components of G. In this paper we determine the maximum number of cut edges in a connected d-regular graph G of order p. 1 Introduction and