jaredec18

Untitled

Sep 26th, 2019
135
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.69 KB | None | 0 0
  1. LINK1) a)
  2.  
  3. In every simple graph having at least two vertices,we can always find two distinct vertices having same degree.
  4.  
  5. Pigeonhole principle:
  6.  
  7. The pigeonhole principle is one of the simple principle that is used in mathematics.
  8.  
  9. We can understand this principle using a simple example stated below.Suppose consider we have 20 pigeons.
  10.  
  11. There are 19 pigeonholes.These 20 pigeons needs to be set into these 19 pigeonholes.To obtain this, at least one of the pigeonhole must have 2 pigeons in it.
  12.  
  13. This is called as pigeonhole principle.
  14.  
  15. Proof:
  16.  
  17. We will generalize the theorem now and understand with 2 vertices later.
  18.  
  19. Consider a connected graph G having n vertices.
  20.  
  21. So every vertex has degree ranging between 1 and n-1.
  22.  
  23. See that there are n vertices in the graph G with degree ranging between 1 and n-1.
  24.  
  25. Using pigeon hole principle that is stated above, we can conclude that there is some value k between 1 and n-1 which has two or more vertices.
  26.  
  27. Now, consider a simple graph G(need not be connected).
  28.  
  29. If G graph has connected component with two or more vertices as a part, then the above result states that the component has two vertices with same degree.
  30.  
  31. If G graph has no connected components in it, then every vertex in G has degree zero.So there are multiple vertices with same degree.
  32.  
  33. B)
  34.  
  35. If G is a simple connected graph with degree of every vertex even,we can delete any edge and it is always connected.
  36.  
  37. Proof:
  38.  
  39. Consider a connected graph G which has n vertices.
  40.  
  41. The minimum number of edges turns out to be 2n.
  42.  
  43. Analyse the situation in which each vertex has at least two edges that are associated with it.
  44.  
  45. Now even if one of the edge of that vertex is removed it still has one more edge that is connected to some other vertex of graph.
  46.  
  47. Hence we can say that a connected graph G having degree of each vertex even is always connected even if we remove one edge.
  48.  
  49. Example:
  50.  
  51. The screenshot shows the connected graph with 3 vertices.
  52.  
  53. https://media.cheggcdn.com/media/8db/8db85e8f-8c48-4dba-b82e-e82a8aa4d376/phpbv2il0.png
  54.  
  55. LINK2)https://media.cheggcdn.com/media/672/67226aaa-0108-4037-aa20-f466e28ecaaa/php1IPP75.png
  56.  
  57. https://media.cheggcdn.com/media/e80/e80450a4-6e4e-4b3f-bf6c-b754427b4b0c/phputPIKT.png
  58.  
  59. LINK3)https://media.cheggcdn.com/media/882/882dec3f-b1bb-41e6-82fe-9de6adf77045/phpqlGgvC.png
  60.  
  61. LINK4)https://media.cheggcdn.com/media/1ac/1ac3e3f8-9607-457a-b934-2d204fcf244d/phpdcSBAg.png
  62.  
  63. https://media.cheggcdn.com/media/072/072a7eb6-79d3-4214-8574-dd5aa04f0b53/phpAgPdJ9.png
  64.  
  65. https://media.cheggcdn.com/media/6e3/6e32d589-bb86-4f1e-bb68-f18e67ac4446/phps5CNGz.png
  66.  
  67. LINK5)https://media.cheggcdn.com/media/5c2/5c2a092c-8476-4c68-b865-af56a1b98886/phpTXgiDi.png
Advertisement
Add Comment
Please, Sign In to add comment