{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Assignment 5 Soln

# Assignment 5 Soln - MATH 239 Assignment 5 Solutions Note...

This preview shows pages 1–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MATH 239 Assignment 5 Solutions Note: The notation e = uv is a shorthand for e = { u,v } . Even though we use the shorthand here, it is always understood that an edge is a subset of the vertices of size 2. 1. For each of the following descriptions of possible graphs, either show that one exists by drawing an example, or prove that such a graph does not exist. (a) A 3-regular graph that contains a bridge. (b) A 4-regular graph that contains a bridge. (c) A graph whose minimum degree is 4 (i.e. every vertex has degree at least 4) that contains a bridge. Solution. (a) Such a graph exists, for example, (b) No such graphs exist. Suppose that G is a 4-reguar graph with a bridge e = uv . Then G- e has two components, say H is the one containing u . Then every vertex in H has degree 4 except for u , which has degree 3 in H . So H is a graph that has exactly one vertex of odd degree, which contradicts the fact that every graph has even number of odd-degree vertices. Therefore, no 4-regular graphs contains a bridge. (c) Such a graph exists, for example, 2. Determine the minimum number of vertices r in any tree T having two vertices of degree 3, two vertices of degree 4, and one vertex of degree 6. Show that your answer is best possible by giving an example of such a tree with exactly r vertices. 1 Solution. Let p denote the number of vertices of T , and let n i denote the number of vertices of degree exactly i . Then p = n 1 + n 2 + n 3 + ··· where we know n 1 = 2 + n 3 + 2 n 4 + 3 n 5 + 4 n 6 + ··· . Therefore, p = (2 + n 3 + 2 n 4 + 3 n 5 + 4 n 6 + ··· ) + n 2 + n 3 + n 4 + ··· = 2 + n 2 + 2 n 3 + 3 n 4 + 4 n 5 + ··· ≥ 2 + 2 n 3 + 3 n 4 + 5 n 6 (since each n i is nonnegative) ≥ 2 + 2(2) + 3(2) + 5 = 17 ....
View Full Document

{[ snackBarMessage ]}

### Page1 / 6

Assignment 5 Soln - MATH 239 Assignment 5 Solutions Note...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.coursehero.com/file/5563099/Assignment-5-Soln/", "fetch_time": 1519286192000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-09/segments/1518891814036.49/warc/CC-MAIN-20180222061730-20180222081730-00200.warc.gz", "warc_record_offset": 851076227, "warc_record_length": 26388, "token_count": 698, "char_count": 2395, "score": 4.0, "int_score": 4, "crawl": "CC-MAIN-2018-09", "snapshot_type": "latest", "language": "en", "language_score": 0.9108968377113342, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00033-of-00064.parquet"}