File:Chordal-graph.svg

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Original file(SVG file, nominally 225 × 171 pixels, file size: 3 KB)

Captions

Captions

Add a one-line explanation of what this file represents

Summary

[edit]
Description A cycle (black) with two chords (green). As for this part, the graph is chordal. Note that both chords are necessary: if one is removed, the other green edge with three black edges would form a cycle of four edges with no chord.
Date 16 February 2006 (original upload date)
Source No machine-readable source provided. Own work assumed (based on copyright claims).
Author No machine-readable author provided. Tizio assumed (based on copyright claims).

Licensing

[edit]
Public domain I, the copyright holder of this work, release this work into the public domain. This applies worldwide.
In some countries this may not be legally possible; if so:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current17:49, 17 February 2006Thumbnail for version as of 17:49, 17 February 2006225 × 171 (3 KB)Tizio (talk | contribs)A chordal graph with a minimal number of chords
18:00, 16 February 2006Thumbnail for version as of 18:00, 16 February 2006225 × 171 (4 KB)Tizio (talk | contribs)White background
17:49, 16 February 2006Thumbnail for version as of 17:49, 16 February 2006207 × 153 (3 KB)Tizio (talk | contribs)An example of a chordal graph: every pair of vertices in a cycle are connected by an egde. If the two vertices are not adjacent in the cycle, that edge is called a chord. Category:Graph theory

The following page uses this file:

File usage on other wikis

The following other wikis use this file: