Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 7ebd25ac536d248d499a3ce2acda963a > files > 1817

Macaulay2-1.3.1-8.fc15.i686.rpm

<?xml version="1.0" encoding="utf-8" ?>  <!-- for emacs: -*- coding: utf-8 -*- -->
<!-- Apache may like this line in the file .htaccess: AddCharset utf-8 .html -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN"	 "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg-flat.dtd" >
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>completeMultiPartite -- returns a complete multipartite graph</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body>
<table class="buttons">
  <tr>
    <td><div><a href="___Connected_sp__Components_sp__Tutorial.html">next</a> | <a href="_complete__Graph.html">previous</a> | <a href="___Connected_sp__Components_sp__Tutorial.html">forward</a> | <a href="_complete__Graph.html">backward</a> | up | <a href="index.html">top</a> | <a href="master.html">index</a> | <a href="toc.html">toc</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div>

    </td>
  </tr>
</table>
<hr/>
<div><h1>completeMultiPartite -- returns a complete multipartite graph</h1>
<div class="single"><h2>Synopsis</h2>
<ul><li><div class="list"><dl class="element"><dt class="heading">Usage: </dt><dd class="value"><div><tt>K = completeMultiPartite(R,n,m)</tt><br/><tt>K = completeMultiPartite(R,L)</tt></div>
</dd></dl>
</div>
</li>
<li><div class="single">Inputs:<ul><li><span><tt>R</tt>, <span>a <a href="../../Macaulay2Doc/html/___Ring.html">ring</a></span></span></li>
<li><span><tt>n</tt>, <span>an <a href="../../Macaulay2Doc/html/___Z__Z.html">integer</a></span>, number of partitions</span></li>
<li><span><tt>m</tt>, <span>an <a href="../../Macaulay2Doc/html/___Z__Z.html">integer</a></span>, size of each partition</span></li>
<li><span><tt>L</tt>, <span>a <a href="../../Macaulay2Doc/html/___List.html">list</a></span>, of integers giving the size of each partition, or a list of partitions that are lists of variables</span></li>
</ul>
</div>
</li>
<li><div class="single">Outputs:<ul><li><span><tt>K</tt>, <span>a <a href="___Graph.html">graph</a></span>, the complete multipartite graph on the given partitions</span></li>
</ul>
</div>
</li>
</ul>
</div>
<div class="single"><h2>Description</h2>
<div><div>A complete multipartite graph is a graph with a partition of the vertices such that every pair of vertices, not both from the same partition, is an edge of the graph. The partitions can be specified by their number and size, by a list of sizes, or by an explicit partition of the variables. Not all variables of the ring need to be used.</div>
<table class="examples"><tr><td><pre>i1 : R = QQ[a,b,c,x,y,z];</pre>
</td></tr>
<tr><td><pre>i2 : completeMultiPartite(R,2,3)

o2 = Graph{edges => {{a, x}, {a, y}, {a, z}, {b, x}, {b, y}, {b, z}, {c, x}, {c, y}, {c, z}}}
           ring => R
           vertices => {a, b, c, x, y, z}

o2 : Graph</pre>
</td></tr>
<tr><td><pre>i3 : completeMultiPartite(R,{2,4})

o3 = Graph{edges => {{a, c}, {a, x}, {a, y}, {a, z}, {b, c}, {b, x}, {b, y}, {b, z}}}
           ring => R
           vertices => {a, b, c, x, y, z}

o3 : Graph</pre>
</td></tr>
<tr><td><pre>i4 : completeMultiPartite(R,{{a,b,c,x},{y,z}})

o4 = Graph{edges => {{a, y}, {a, z}, {b, y}, {b, z}, {c, y}, {c, z}, {x, y}, {x, z}}}
           ring => R
           vertices => {a, b, c, x, y, z}

o4 : Graph</pre>
</td></tr>
</table>
<div>When <tt>n</tt> is the number of variables and <tt>M = 1</tt>, we recover the complete graph.</div>
<table class="examples"><tr><td><pre>i5 : R = QQ[a,b,c,d,e];</pre>
</td></tr>
<tr><td><pre>i6 : t1 = completeMultiPartite(R,5,1)

o6 = Graph{edges => {{a, b}, {a, c}, {a, d}, {a, e}, {b, c}, {b, d}, {b, e}, {c, d}, {c, e}, {d, e}}}
           ring => R
           vertices => {a, b, c, d, e}

o6 : Graph</pre>
</td></tr>
<tr><td><pre>i7 : t2 = completeGraph R

o7 = Graph{edges => {{a, b}, {a, c}, {a, d}, {a, e}, {b, c}, {b, d}, {b, e}, {c, d}, {c, e}, {d, e}}}
           ring => R
           vertices => {a, b, c, d, e}

o7 : Graph</pre>
</td></tr>
<tr><td><pre>i8 : t1 == t2

o8 = true</pre>
</td></tr>
</table>
</div>
</div>
<div class="single"><h2>See also</h2>
<ul><li><span><a href="_complete__Graph.html" title="returns a complete graph">completeGraph</a> -- returns a complete graph</span></li>
<li><span><a href="___Constructor_sp__Overview.html" title="a summary of the many ways of making graphs and hypergraphs">Constructor Overview</a> -- a summary of the many ways of making graphs and hypergraphs</span></li>
</ul>
</div>
<div class="waystouse"><h2>Ways to use <tt>completeMultiPartite</tt> :</h2>
<ul><li>completeMultiPartite(Ring,List)</li>
<li>completeMultiPartite(Ring,ZZ,ZZ)</li>
</ul>
</div>
</div>
</body>
</html>