Abstract
AbstractWe study graphs G = (V,E) containing a long cycle which for given integers a1, a2,ā¦,ak ā \input amssym ${\Bbb N}$ have an edge cut whose removal results in k components with vertex sets V1,V2,ā¦,Vk such that |Vi| ā„ ai for 1 ā¤ i ā¤ k. Our results closely relate to problems and recent research in network sharing and network reliability. Ā© 2008 Wiley Periodicals, Inc. NETWORKS, 2008
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have