Sampathkumar, E.
(1992)
*A generalization of Menger's theorem for certain unicyclic graphs.*
Graphs and Combinatorics, 8 (4).
pp. 377-380.

Text
A generalization of Menger's theorem for certain unicyclic graphs.pdf Restricted to Registered users only Download (132kB) | Request a copy |

Official URL: https://doi.org/10.1007/BF02351593

## Abstract

Let G be a unicyclic graph such that at most two points on its cycle have degrees greater-than-or-equal-to 3 Then the minimum number of points separating any independent set S of points in G is th maximum number of disjoint paths between the points of S.

Item Type: | Article |
---|---|

Subjects: | E Mathematical Science > Mathematics |

Divisions: | Department of > Mathematics |

Depositing User: | Users 23 not found. |

Date Deposited: | 13 May 2021 05:18 |

Last Modified: | 13 May 2021 05:18 |

URI: | http://eprints.uni-mysore.ac.in/id/eprint/16467 |

### Actions (login required)

View Item |