Home
Hostname: page-component-55597f9d44-2qt69 Total loading time: 0.392 Render date: 2022-08-15T01:56:24.965Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true
Boolean Functions
Theory, Algorithms, and Applications
Buy print or eBook[Opens in a new window]

A - Graphs and hypergraphs

Published online by Cambridge University Press:  01 June 2011

Summary

This appendix proposes a short primer on graph and hypergraph theory. It sums up the basic concepts and terminology used in the remainder of the monograph. For (much) more information, we refer the reader to numerous excellent books dealing in-depth with this topic, such as Bang-Jensen and Gutin [51]; Berge [71, 72]; Brandstädt, Le, and Spinrad [152]; Golumbic [398]; Mahadev and Peled [645]; or Schrijver [814].

Undirected graphs

An undirected graph, or graph for short, is a pair of finite sets G = (V, E) in which V is the set of vertices of the graph, and E is a set of unordered pairs of vertices called edges of the graph. Abiding by widespread conventions, we often use the notation (u,v), or even simply uv, for an edge {u,v}. Occasionally, we consider undirected graphs with loops, where a loop is an edge of the form (v,v) for vV (we may view a loop as an edge of cardinality 1).

A graph can be represented as a diagram consisting of points (vertices) joined by lines (edges), as in Figure A.1.

When e = (u,v) is an edge, we say that vertices u and v are adjacent, that u is a neighbor of v, that u and v are incident to e, that u and v are the endpoints of e, and so forth. The neighborhood of a vertex uV is the set N(u) = {vV : (u,v) ∈ E}.

Type
Chapter
Information
Boolean Functions
Theory, Algorithms, and Applications
, pp. 609 - 614
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Purchase

Buy print or eBook[Opens in a new window]

Save book to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×