Search Results for ""

A point-to-line and line-to-point transformation which transforms points A into lines a^' and lines b into points B^' such that a^' passes through B^' iff A^' lies on b.

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...

A polyiamond consisting of equilateral triangles arranged along a line.

A point which does not lie on at least one ordinary line.

The straight polyomino of order n is the n-polyomino in which all squares are placed along a line.

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...

The helm graph H_n is the graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. Helm graphs are graceful (Gallian 2018), with the odd ...