question 1 and question 3 half done

harshitjain17 · Sep 28, 2022 · b28936b · b28936b
2 parents 9d281ad + 5a24659
commit b28936b
Showing 1 changed file with 4 additions and 0 deletions.
diff --git a/HW4/hw4.tex b/HW4/hw4.tex
@@ -175,9 +175,13 @@
 
     \item The most number of edges that an undirected graph can have are $: \frac{|V|(|V|-1)}{2}$
 
+<<<<<<< HEAD
     \item Since the degree of a vertex is the number of edges incident with that vertex, the sum of degree counts the total number of times an edge is incident with a vertex.
     Since every edge is incident with exactly two vertices, each edge gets counted twice, once at each end. Thus the sum of the degrees is equal twice the number of edges.
     Let $n$ be the number of edges in a simple graph $G(E,V)$. We proceed our proof 
+=======
+    \item 
+>>>>>>> 5a2465958b64632aaff472092fc7a331d994f60b
 
     \item