Abstract
This paper considers the concept of restricted edge-connectivity, and relates that to the edge-degree of a connected graph. The author gives some necessary conditions for a graph whose restricted edge-connectivity is smaller than its minimum edge-degree, then uses these conditions to show some large classes of graphs, such as all connected edge-transitive graphs except a star, and all connected vertex-transitive graphs with odd order or without triangles, have equality of the restricted edge-connectivity and the minimun edge-degree.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
