<?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>EdgeIdeals : Table of Contents</title> <link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/> </head> <body><div><a href="index.html">top</a> | <a href="master.html">index</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div> <hr/> <h1>EdgeIdeals : Table of Contents</h1> <ul><li><span><span><a href="index.html" title="A package for working with the edge ideals of (hyper)graphs">EdgeIdeals</a> -- A package for working with the edge ideals of (hyper)graphs</span></span></li> <li><span><span><a href="_adjacency__Matrix.html" title="returns the adjacency Matrix of a graph">adjacencyMatrix</a> -- returns the adjacency Matrix of a graph</span></span></li> <li><span><span><a href="_all__Even__Holes.html" title="returns all even holes in a graph">allEvenHoles</a> -- returns all even holes in a graph</span></span></li> <li><span><span><a href="_all__Odd__Holes.html" title="returns all odd holes in a graph">allOddHoles</a> -- returns all odd holes in a graph</span></span></li> <li><span><span><a href="_anti__Cycle.html" title="returns a graph of an anticycle">antiCycle</a> -- returns a graph of an anticycle</span></span></li> <li><span><span><a href="___Branch__Limit.html" title="optional argument for randomHyperGraph">BranchLimit</a> -- optional argument for randomHyperGraph</span></span></li> <li><span><span><a href="_change__Ring.html" title="replaces vertices with variables of a different ring">changeRing</a> -- replaces vertices with variables of a different ring</span></span></li> <li><span><span><a href="_change__Ring_lp..._cm_sp__Maximal__Edges_sp_eq_gt_sp..._rp.html" title="optional argument for changeRing">changeRing(..., MaximalEdges => ...)</a> -- optional argument for changeRing</span></span></li> <li><span><span><a href="_chromatic__Number.html" title="computes the chromatic number of a hypergraph">chromaticNumber</a> -- computes the chromatic number of a hypergraph</span></span></li> <li><span><span><a href="_clique__Complex.html" title="returns the clique complex of a graph">cliqueComplex</a> -- returns the clique complex of a graph</span></span></li> <li><span><span><a href="_clique__Number.html" title="computes the clique number of a graph">cliqueNumber</a> -- computes the clique number of a graph</span></span></li> <li><span><span><a href="_complement__Graph.html" title="returns the complement of a graph or hypergraph">complementGraph</a> -- returns the complement of a graph or hypergraph</span></span></li> <li><span><span><a href="_complete__Graph.html" title="returns a complete graph">completeGraph</a> -- returns a complete graph</span></span></li> <li><span><span><a href="_complete__Multi__Partite.html" title="returns a complete multipartite graph">completeMultiPartite</a> -- returns a complete multipartite graph</span></span></li> <li><span><span><a href="___Connected_sp__Components_sp__Tutorial.html" title="clarifying the difference between graph and hypergraph components">Connected Components Tutorial</a> -- clarifying the difference between graph and hypergraph components</span></span></li> <li><span><span><a href="_connected__Components.html" title="returns the connected components of a hypergraph">connectedComponents</a> -- returns the connected components of a hypergraph</span></span></li> <li><span><span><a href="_connected__Graph__Components.html" title="returns the connected components of a graph">connectedGraphComponents</a> -- returns the connected components of a graph</span></span></li> <li><span><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></span></li> <li><span><span><a href="_cover__Ideal.html" title="creates the cover ideal of a (hyper)graph">coverIdeal</a> -- creates the cover ideal of a (hyper)graph</span></span></li> <li><span><span><a href="_cycle.html" title="returns a graph cycle">cycle</a> -- returns a graph cycle</span></span></li> <li><span><span><a href="_degree__Vertex.html" title="returns the degree of a vertex">degreeVertex</a> -- returns the degree of a vertex</span></span></li> <li><span><span><a href="_delete__Edges.html" title="returns the (hyper)graph with specified edges removed">deleteEdges</a> -- returns the (hyper)graph with specified edges removed</span></span></li> <li><span><span><a href="_edge__Ideal.html" title="creates the edge ideal of a (hyper)graph">edgeIdeal</a> -- creates the edge ideal of a (hyper)graph</span></span></li> <li><span><span><a href="_edges.html" title="gets the edges of a (hyper)graph">edges</a> -- gets the edges of a (hyper)graph</span></span></li> <li><span><span><a href="___Extended_sp__Example.html" title="an extended example using EdgeIdeals">Extended Example</a> -- an extended example using EdgeIdeals</span></span></li> <li><span><span><a href="_get__Cliques.html" title="returns cliques in a graph">getCliques</a> -- returns cliques in a graph</span></span></li> <li><span><span><a href="_get__Edge.html" title="gets the n-th edge in a (hyper)graph">getEdge</a> -- gets the n-th edge in a (hyper)graph</span></span></li> <li><span><span><a href="_get__Edge__Index.html" title="finds the index of an edge in a HyperGraph">getEdgeIndex</a> -- finds the index of an edge in a HyperGraph</span></span></li> <li><span><span><a href="_get__Good__Leaf.html" title="returns an edge that is a good leaf">getGoodLeaf</a> -- returns an edge that is a good leaf</span></span></li> <li><span><span><a href="_get__Good__Leaf__Index.html" title="returns the index of an edge that is a good leaf">getGoodLeafIndex</a> -- returns the index of an edge that is a good leaf</span></span></li> <li><span><span><a href="_get__Max__Cliques.html" title="returns maximal cliques in a graph">getMaxCliques</a> -- returns maximal cliques in a graph</span></span></li> <li><span><span><a href="___Gins.html" title="optional argument for isSCM">Gins</a> -- optional argument for isSCM</span></span></li> <li><span><span><a href="___Graph.html" title="a class for graphs">Graph</a> -- a class for graphs</span></span></li> <li><span><span><a href="_graph.html" title="constructor for Graph">graph</a> -- constructor for Graph</span></span></li> <li><span><span><a href="_has__Good__Leaf.html" title="determines if a HyperGraph contains a good leaf">hasGoodLeaf</a> -- determines if a HyperGraph contains a good leaf</span></span></li> <li><span><span><a href="_has__Odd__Hole.html" title="tells whether a graph contains an odd hole">hasOddHole</a> -- tells whether a graph contains an odd hole</span></span></li> <li><span><span><a href="___Hyper__Graph.html" title="a class for hypergraphs">HyperGraph</a> -- a class for hypergraphs</span></span></li> <li><span><span><a href="_hyper__Graph.html" title="constructor for HyperGraph">hyperGraph</a> -- constructor for HyperGraph</span></span></li> <li><span><span><a href="___Hyper__Graph_sp_eq_eq_sp__Hyper__Graph.html" title="equality">HyperGraph == HyperGraph</a> -- equality</span></span></li> <li><span><span><a href="_hyper__Graph__To__Simplicial__Complex.html" title="makes a simplicial complex from a (hyper)graph">hyperGraphToSimplicialComplex</a> -- makes a simplicial complex from a (hyper)graph</span></span></li> <li><span><span><a href="_incidence__Matrix.html" title="returns the incidence matrix of a hypergraph">incidenceMatrix</a> -- returns the incidence matrix of a hypergraph</span></span></li> <li><span><span><a href="_independence__Complex.html" title="returns the independence complex of a (hyper)graph">independenceComplex</a> -- returns the independence complex of a (hyper)graph</span></span></li> <li><span><span><a href="_independence__Number.html" title="determines the independence number of a graph">independenceNumber</a> -- determines the independence number of a graph</span></span></li> <li><span><span><a href="_induced__Graph.html" title="returns the induced subgraph of a graph">inducedGraph</a> -- returns the induced subgraph of a graph</span></span></li> <li><span><span><a href="_induced__Graph_lp..._cm_sp__Original__Ring_sp_eq_gt_sp..._rp.html" title="use OriginalRing inside inducedGraph or inducedHyperGraph">inducedGraph(..., OriginalRing => ...)</a> -- use OriginalRing inside inducedGraph or inducedHyperGraph</span></span></li> <li><span><span><a href="_induced__Hyper__Graph.html" title="returns the induced subgraph of a (hyper)graph">inducedHyperGraph</a> -- returns the induced subgraph of a (hyper)graph</span></span></li> <li><span><span><a href="_is__Bipartite.html" title="determines if a graph is bipartite">isBipartite</a> -- determines if a graph is bipartite</span></span></li> <li><span><span><a href="_is__Chordal.html" title="determines if a graph is chordal">isChordal</a> -- determines if a graph is chordal</span></span></li> <li><span><span><a href="_is__C__M.html" title="determines if a (hyper)graph is Cohen-Macaulay">isCM</a> -- determines if a (hyper)graph is Cohen-Macaulay</span></span></li> <li><span><span><a href="_is__Connected.html" title="determines if a (hyper)graph is connected">isConnected</a> -- determines if a (hyper)graph is connected</span></span></li> <li><span><span><a href="_is__Connected__Graph.html" title="determines if a graph is connected">isConnectedGraph</a> -- determines if a graph is connected</span></span></li> <li><span><span><a href="_is__Edge.html" title="determines if an edge is in a (hyper)graph">isEdge</a> -- determines if an edge is in a (hyper)graph</span></span></li> <li><span><span><a href="_is__Forest.html" title="determines whether a (hyper)graph is a forest">isForest</a> -- determines whether a (hyper)graph is a forest</span></span></li> <li><span><span><a href="_is__Good__Leaf.html" title="determines if an edge is a good leaf">isGoodLeaf</a> -- determines if an edge is a good leaf</span></span></li> <li><span><span><a href="_is__Graph.html" title="determines if a hypergraph is a graph">isGraph</a> -- determines if a hypergraph is a graph</span></span></li> <li><span><span><a href="_is__Leaf.html" title="determines if an edge (or vertex) is a leaf of a (hyper)graph">isLeaf</a> -- determines if an edge (or vertex) is a leaf of a (hyper)graph</span></span></li> <li><span><span><a href="_isolated__Vertices.html" title="returns all vertices not contained in any edge">isolatedVertices</a> -- returns all vertices not contained in any edge</span></span></li> <li><span><span><a href="_is__Perfect.html" title="determines whether a graph is perfect">isPerfect</a> -- determines whether a graph is perfect</span></span></li> <li><span><span><a href="_is__S__C__M.html" title="determines if a (hyper)graph is sequentially Cohen-Macaulay">isSCM</a> -- determines if a (hyper)graph is sequentially Cohen-Macaulay</span></span></li> <li><span><span><a href="_is__S__C__M_lp..._cm_sp__Gins_sp_eq_gt_sp..._rp.html" title="use gins inside isSCM">isSCM(..., Gins => ...)</a> -- use gins inside isSCM</span></span></li> <li><span><span><a href="_line__Graph.html" title="returns the line graph of a (hyper)graph">lineGraph</a> -- returns the line graph of a (hyper)graph</span></span></li> <li><span><span><a href="___Maximal__Edges.html" title="optional argument for changeRing">MaximalEdges</a> -- optional argument for changeRing</span></span></li> <li><span><span><a href="_neighbors.html" title="returns the neighbors of a vertex or list of vertices">neighbors</a> -- returns the neighbors of a vertex or list of vertices</span></span></li> <li><span><span><a href="_num__Connected__Components.html" title="returns the number of connected components in a (hyper)graph">numConnectedComponents</a> -- returns the number of connected components in a (hyper)graph</span></span></li> <li><span><span><a href="_num__Connected__Graph__Components.html" title="returns the number of connected components in a graph">numConnectedGraphComponents</a> -- returns the number of connected components in a graph</span></span></li> <li><span><span><a href="_num__Triangles.html" title="returns the number of triangles in a graph">numTriangles</a> -- returns the number of triangles in a graph</span></span></li> <li><span><span><a href="___Original__Ring.html" title="optional argument for inducedHyperGraph">OriginalRing</a> -- optional argument for inducedHyperGraph</span></span></li> <li><span><span><a href="_random__Graph.html" title="returns a random graph">randomGraph</a> -- returns a random graph</span></span></li> <li><span><span><a href="_random__Hyper__Graph.html" title="returns a random hypergraph">randomHyperGraph</a> -- returns a random hypergraph</span></span></li> <li><span><span><a href="_random__Hyper__Graph_lp..._cm_sp__Branch__Limit_sp_eq_gt_sp..._rp.html" title="limit recursive branching in randomHyperGraph">randomHyperGraph(..., BranchLimit => ...)</a> -- limit recursive branching in randomHyperGraph</span></span></li> <li><span><span><a href="_random__Hyper__Graph_lp..._cm_sp__Time__Limit_sp_eq_gt_sp..._rp.html" title="limit the running time of randomHyperGraph">randomHyperGraph(..., TimeLimit => ...)</a> -- limit the running time of randomHyperGraph</span></span></li> <li><span><span><a href="_random__Uniform__Hyper__Graph.html" title="returns a random uniform hypergraph">randomUniformHyperGraph</a> -- returns a random uniform hypergraph</span></span></li> <li><span><span><a href="_ring_lp__Hyper__Graph_rp.html" title="gives the ring of a (hyper)graph">ring(HyperGraph)</a> -- gives the ring of a (hyper)graph</span></span></li> <li><span><span><a href="_simplicial__Complex__To__Hyper__Graph.html" title="makes a (hyper)graph from a simplicial complex">simplicialComplexToHyperGraph</a> -- makes a (hyper)graph from a simplicial complex</span></span></li> <li><span><span><a href="_smallest__Cycle__Size.html" title="returns the size of the smallest induced cycle of a graph">smallestCycleSize</a> -- returns the size of the smallest induced cycle of a graph</span></span></li> <li><span><span><a href="_spanning__Tree.html" title="returns a spanning tree of a graph">spanningTree</a> -- returns a spanning tree of a graph</span></span></li> <li><span><span><a href="___Time__Limit.html" title="optional argument for randomHyperGraph">TimeLimit</a> -- optional argument for randomHyperGraph</span></span></li> <li><span><span><a href="_vertex__Cover__Number.html" title="find the vertex covering number of a (hyper)graph">vertexCoverNumber</a> -- find the vertex covering number of a (hyper)graph</span></span></li> <li><span><span><a href="_vertex__Covers.html" title="list the minimal vertex covers of a (hyper)graph">vertexCovers</a> -- list the minimal vertex covers of a (hyper)graph</span></span></li> <li><span><span><a href="_vertices.html" title="gets the vertices of a (hyper)graph">vertices</a> -- gets the vertices of a (hyper)graph</span></span></li> </ul> </body> </html>
