https://cs.indstate.edu/web/index.php?action=history&feed=atom&title=GraphsGraphs - Revision history2026-04-14T16:10:17ZRevision history for this page on the wikiMediaWiki 1.44.0https://cs.indstate.edu/web/index.php?title=Graphs&diff=249&oldid=prevJkinne: 1 revision imported2025-08-17T13:22:16Z<p>1 revision imported</p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 13:22, 17 August 2025</td>
</tr><tr><td colspan="4" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div>
</td></tr>
<!-- diff cache key wiki2:diff:1.41:old-248:rev-249 -->
</table>Jkinnehttps://cs.indstate.edu/web/index.php?title=Graphs&diff=248&oldid=prevwiki_previous>Jkinne: /* Assignment */2022-11-18T02:48:50Z<p><span class="autocomment">Assignment</span></p>
<p><b>New page</b></p><div>=Assignment=<br />
Problems from [https://courses.csail.mit.edu/6.042/spring18/mcs.pdf Mathematics for Computer Science] (MCS). These are tentative, I will probably remove a few after working them out myself.<br />
# MCS Problem 12.2, but instead of 20, use (first two letters of your last name, add them up, % 10, *2, +10). Kinne: Ki, 10+8, 18, %10 = 8, *2 = 16, +10 = 26. Note: simple graph is unweighted, undirected, no self loops.<br />
# MCS Problem 12.12 (ungraded). Bipartite: 2 parts.<br />
# MCS Problem 12.23 and note that Chi(G) is the chromatic number of G - the smallest number of colors that can be used to color the vertices of the graph.<br />
# MCS Problem 12.25. Connected component - can get from any vertex in the component to any other in the component, and cannot go outside the component.<br />
# MCS Problem 12.33. Assume we are talking about graphs that are undirected and without self loops.<br />
# MCS Problem 12.46. Base case: 1 vertex graph, 2 vertex graph, 3 vertex graph.<br />
# MCS Problem 12.50. Diameter - largest distance between any two vertices. Note - "degrees of separation", "Erdos number". Note that a tree is a connected graph without any cycles.</div>wiki_previous>Jkinne