Premium
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
Author(s) -
Rautenbach Dieter,
Volkmann Lutz
Publication year - 2008
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20243
Subject(s) - combinatorics , vertex (graph theory) , enhanced data rates for gsm evolution , mathematics , vertex connectivity , reliability (semiconductor) , computer science , discrete mathematics , graph , physics , telecommunications , power (physics) , quantum mechanics
We study graphs G = ( V , E ) containing a long cycle which for given integers a 1 , a 2 ,…, a k ∈ \input amssym ${\Bbb N}$ have an edge cut whose removal results in k components with vertex sets V 1 , V 2 ,…, V k such that | V i | ≥ a i 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom