Content deleted Content added
Jon Awbrey (talk | contribs) m who keeps putting in these useless links ??? |
Paul August (talk | contribs) add two citations |
||
Line 45:
A '''simple graph''' is always understood to mean a "graph" which contains no loops or multiple edges. However, the unqualified term "graph" might allow or disallow loops and multiple edges in the literature, according to the preferences of the author and the requirements of the particular topic.
The term "[[multigraph]]" is used to indicate that multiple edges (and sometimes loops) are allowed. Where graphs are defined so as to ''allow'' loops and multiple edges, a multigraph is often defined to mean a graph without loops,<ref> For example, see Balakrishnan, p. 1, and Gross, p. 4.</ref> however, where graphs are defined so as to ''disallow'' loops and mutiple edges, the term is often defined to mean a "graph" which can have loops or multiple edges.<ref>For example, see. Bollobas, p. 7 and Diestel, p. 25.</ref>
Sometimes the term "[[pseudograph]]" is used to indicate that both multiple edges and loops are allowed. In exceptional situations it is even necessary to have edges with only one end, called '''halfedges''', or no ends ('''loose edges'''); see for example [[signed graph]]s.
Line 108:
In [[model theory]], a graph is just a [[structure (model theory)|structure]]. But in that case, there is no limitation on the number of edges: it can be any [[cardinal number]].
== Notes==
<div class="references-small">
<references/>
</div>
==References==
| |||