Search Results for ""

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

A plane figure consisting of four points, each of which is joined to two other points by a line segment (where the line segments may intersect). A quadrangle may therefore be ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

The locus of a point P (or the envelope of a line) fixed in relation to a curve C which slides between fixed curves. For example, if C is a line segment and P a point on the ...