Paper Info

Title | ||
---|---|---|

5-Shredders in 5-connected graphs |

Abstract | ||
---|---|---|

For a graph G, a subset S of V(G) is called a shredder if G-S consists of three or more components. We show that if G is a 5-connected graph with |V(G)|=135, then the number of shredders of cardinality 5 of G is less than or equal to (2|V(G)|-10)/3. |

Year | DOI | Venue |
---|---|---|

2009 | 10.1016/j.disc.2008.02.028 | Discrete Mathematics |

Keywords | Field | DocType |

upper bound,graph,shredder,connectivity,graph connectivity,connected graph | Discrete mathematics,Combinatorics,Line graph,Bound graph,Upper and lower bounds,Simplex graph,Cardinality,Distance-regular graph,Connectivity,Windmill graph,Mathematics | Journal |

Volume | Issue | ISSN |

309 | 6 | Discrete Mathematics |

Citations | PageRank | References |

0 | 0.34 | 6 |

Authors | ||

3 |

Authors (3 rows)

Cited by (0 rows)

References (6 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

Yoshimi Egawa | 1 | 0 | 0.34 |

Yumiko Okadome | 2 | 0 | 0.34 |

Masanori Takatou | 3 | 3 | 1.59 |