Chordal Graph
(Sprache: Englisch)
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In the mathematical area of graph theory, a graph is chordal if each of its cycles of four or more nodes has a chord, which is an...
Leider schon ausverkauft
versandkostenfrei
Buch
29.00 €
Produktdetails
Produktinformationen zu „Chordal Graph “
Klappentext zu „Chordal Graph “
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In the mathematical area of graph theory, a graph is chordal if each of its cycles of four or more nodes has a chord, which is an edge joining two nodes that are not adjacent in the cycle. An equivalent definition is that any chordless cycles have at most three nodes. Chordal graphs are a subset of the perfect graphs. They are sometimes also called triangulated graphs. A perfect elimination ordering in a graph is an ordering of the vertices of the graph such that, for each vertex v, v and the neighbors of v that occur later than v in the order form a clique. A graph is chordal if and only if it has a perfect elimination ordering (Fulkerson & Gross 1965).
Bibliographische Angaben
- 2010, 64 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Herausgegeben von Surhone, Lambert M.; Timpledon, Miriam T.; Marseken, Susan F.
- Verlag: Betascript Publishing
- ISBN-10: 6130421893
- ISBN-13: 9786130421892
Sprache:
Englisch
Kommentar zu "Chordal Graph"
0 Gebrauchte Artikel zu „Chordal Graph“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Chordal Graph".
Kommentar verfassen