On the number of cut-vertices in a graph
A connected graph with n vertices contains no more than r2r-2(n-2) cutvertices of degree r. All graphs in which the bound is achieved are described. In addition, for graphs of maximum degree three and minimum δ, best possible bounds are obtained for δ=1, 2, 3.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1989-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171289000359 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556266179788800 |
|---|---|
| author | Glenn Hopkins William Staton |
| author_facet | Glenn Hopkins William Staton |
| author_sort | Glenn Hopkins |
| collection | DOAJ |
| description | A connected graph with n vertices contains no more than r2r-2(n-2) cutvertices
of degree r. All graphs in which the bound is achieved are described. In
addition, for graphs of maximum degree three and minimum δ, best possible bounds are
obtained for δ=1, 2, 3. |
| format | Article |
| id | doaj-art-37073a56d72047ec87dd3110c662047c |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1989-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-37073a56d72047ec87dd3110c662047c2025-02-03T05:45:54ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251989-01-0112230530810.1155/S0161171289000359On the number of cut-vertices in a graphGlenn Hopkins0William Staton1Department of Mathematics, University of Mississippi, University 38677, MS, USADepartment of Mathematics, University of Mississippi, University 38677, MS, USAA connected graph with n vertices contains no more than r2r-2(n-2) cutvertices of degree r. All graphs in which the bound is achieved are described. In addition, for graphs of maximum degree three and minimum δ, best possible bounds are obtained for δ=1, 2, 3.http://dx.doi.org/10.1155/S0161171289000359 |
| spellingShingle | Glenn Hopkins William Staton On the number of cut-vertices in a graph International Journal of Mathematics and Mathematical Sciences |
| title | On the number of cut-vertices in a graph |
| title_full | On the number of cut-vertices in a graph |
| title_fullStr | On the number of cut-vertices in a graph |
| title_full_unstemmed | On the number of cut-vertices in a graph |
| title_short | On the number of cut-vertices in a graph |
| title_sort | on the number of cut vertices in a graph |
| url | http://dx.doi.org/10.1155/S0161171289000359 |
| work_keys_str_mv | AT glennhopkins onthenumberofcutverticesinagraph AT williamstaton onthenumberofcutverticesinagraph |