EVOLUTION-MANAGER
Edit File: is_separator.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><title>R: Vertex separators</title> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="stylesheet" type="text/css" href="R.css" /> </head><body> <table width="100%" summary="page for is_separator {igraph}"><tr><td>is_separator {igraph}</td><td style="text-align: right;">R Documentation</td></tr></table> <h2>Vertex separators</h2> <h3>Description</h3> <p>Check whether a given set of vertices is a vertex separator. </p> <h3>Usage</h3> <pre> is_separator(graph, candidate) </pre> <h3>Arguments</h3> <table summary="R argblock"> <tr valign="top"><td><code>graph</code></td> <td> <p>The input graph. It may be directed, but edge directions are ignored.</p> </td></tr> <tr valign="top"><td><code>candidate</code></td> <td> <p>A numeric vector giving the vertex ids of the candidate separator.</p> </td></tr> </table> <h3>Details</h3> <p><code>is_separator</code> decides whether the supplied vertex set is a vertex separator. A vertex set is a vertex separator if its removal results a disconnected graph. </p> <p>In the special case of a fully connected graph with <i>n</i> vertices, each set of <i>n-1</i> vertices is considered to be a vertex separator. </p> <h3>Value</h3> <p>A logical scalar, whether the supplied vertex set is a (minimal) vertex separator or not. </p> <h3>See Also</h3> <p><code><a href="is_min_separator.html">is_min_separator</a></code>, <code><a href="min_separators.html">min_separators</a></code> lists all vertex separator of minimum size. </p> <hr /><div style="text-align: center;">[Package <em>igraph</em> version 1.3.5 <a href="00Index.html">Index</a>]</div> </body></html>