<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Homework How-to &#187; disconnected</title>
	<atom:link href="http://homeworkhowto.com/tag/disconnected/feed/" rel="self" type="application/rss+xml" />
	<link>http://homeworkhowto.com</link>
	<description>Homework. Easy.</description>
	<lastBuildDate>Wed, 06 Jan 2010 21:14:39 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Bridge</title>
		<link>http://homeworkhowto.com/bridge/</link>
		<comments>http://homeworkhowto.com/bridge/#comments</comments>
		<pubDate>Tue, 05 Jan 2010 20:10:45 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[bridge]]></category>
		<category><![CDATA[connected]]></category>
		<category><![CDATA[disconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[edge]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[resulting]]></category>
		<category><![CDATA[structure]]></category>
		<category><![CDATA[subgraph]]></category>
		<category><![CDATA[vertex]]></category>
		<category><![CDATA[vertices]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/bridge/</guid>
		<description><![CDATA[An Introduction to Bridges


Description

A detailed tutorial on mathematical bridges. Step by step tutorial including several examples of mathematical bridges for reference.

Overview

The bridge is a type of mathematical structure. When an edge is taken off of a connected graph, and the resulting graph is disconnected, that edge is considered to be a bridge. Either way, the [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>An Introduction to Bridges</strong></h3>
<p><a href="http://homeworkhowto.com/bridge/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on mathematical bridges. Step by step tutorial including several examples of mathematical bridges for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>The bridge is a type of mathematical structure. When an edge is taken off of a connected graph, and the resulting graph is disconnected, that edge is considered to be a bridge. Either way, the resulting graph is called a subgraph. The name &#8220;bridge&#8221; was thought up for these edges because they connect one part of the structure to another part of the structure, and are extremely important in a graph.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/bridge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Disconnected Graphs</title>
		<link>http://homeworkhowto.com/disconnected-graphs/</link>
		<comments>http://homeworkhowto.com/disconnected-graphs/#comments</comments>
		<pubDate>Wed, 30 Dec 2009 01:49:38 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[closed]]></category>
		<category><![CDATA[connected]]></category>
		<category><![CDATA[direct]]></category>
		<category><![CDATA[disconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[edge]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[hexagon]]></category>
		<category><![CDATA[open]]></category>
		<category><![CDATA[opposite]]></category>
		<category><![CDATA[path]]></category>
		<category><![CDATA[rectangle]]></category>
		<category><![CDATA[shape]]></category>
		<category><![CDATA[star]]></category>
		<category><![CDATA[triangle]]></category>
		<category><![CDATA[vertex]]></category>
		<category><![CDATA[vertices]]></category>
		<category><![CDATA[walk]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/disconnected-graphs/</guid>
		<description><![CDATA[How to Identify a Disconnected Graph


Description

A detailed tutorial on how to identify disconnected graphs. Step by step tutorial including several examples of disconnected graphs for reference.

Overview

A disconnected graph is a graph where not every single vertex is connected to all other vertices. Typically, graphs will have paths from all vertices, but if there is not [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Identify a Disconnected Graph</strong></h3>
<p><a href="http://homeworkhowto.com/disconnected-graphs/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p></strong></p>
<p>A detailed tutorial on how to identify disconnected graphs. Step by step tutorial including several examples of disconnected graphs for reference.</p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p></strong></p>
<p>A disconnected graph is a graph where not every single vertex is connected to all other vertices. Typically, graphs will have paths from all vertices, but if there is not a direct path from each and every vertex, then it is considered to be a disconnected graph. Some common shapes that are seen that are disconnected graphs are stars, rectangles, and hexagons. The opposite of a disconnected graph is a connected graph.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/disconnected-graphs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Connected Graphs</title>
		<link>http://homeworkhowto.com/connected-graphs/</link>
		<comments>http://homeworkhowto.com/connected-graphs/#comments</comments>
		<pubDate>Wed, 30 Dec 2009 01:46:12 +0000</pubDate>
		<dc:creator>Christine</dc:creator>
				<category><![CDATA[Discrete Math]]></category>
		<category><![CDATA[closed]]></category>
		<category><![CDATA[connected]]></category>
		<category><![CDATA[direct]]></category>
		<category><![CDATA[disconnected]]></category>
		<category><![CDATA[discrete math]]></category>
		<category><![CDATA[edge]]></category>
		<category><![CDATA[graph]]></category>
		<category><![CDATA[hexagon]]></category>
		<category><![CDATA[open]]></category>
		<category><![CDATA[opposite]]></category>
		<category><![CDATA[path]]></category>
		<category><![CDATA[rectangle]]></category>
		<category><![CDATA[shape]]></category>
		<category><![CDATA[star]]></category>
		<category><![CDATA[triangle]]></category>
		<category><![CDATA[vertex]]></category>
		<category><![CDATA[vertices]]></category>
		<category><![CDATA[walk]]></category>

		<guid isPermaLink="false">http://homeworkhowto.com/connected-graphs/</guid>
		<description><![CDATA[How to Identify a Connected Graph

Description
 

A detailed tutorial on how to identify connected graphs. Step by step tutorial including several examples of connected graphs for reference.

 

Overview
 

A connected graph is a graph where every single vertex is connected to every other vertex. This does not mean to simply have a clear path from one vertex to [...]]]></description>
			<content:encoded><![CDATA[<h3><strong>How to Identify a Connected Graph</strong></h3>
<p><a href="http://homeworkhowto.com/connected-graphs/"><em>Click here to view the embedded video.</em></a></p>
<hr /><strong></p>
<p class="content_description">Description</p>
<p> </p>
<p></strong></p>
<p>A detailed tutorial on how to identify connected graphs. Step by step tutorial including several examples of connected graphs for reference.</p>
<div><strong></strong></div>
<p> </p>
<p><strong></p>
<p class="content_overview">Overview</p>
<p> </p>
<p></strong></p>
<p>A connected graph is a graph where every single vertex is connected to every other vertex. This does not mean to simply have a clear path from one vertex to another &#8211; it means there needs to be a direct path, or an edge, between two vertices. A triangle is a commonly seen shape that is a connected graph. The opposite of a connected graph is a disconnected graph.</p>
]]></content:encoded>
			<wfw:commentRss>http://homeworkhowto.com/connected-graphs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

