Search Results for ""

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The keratoid cusp is quintic algebraic curve defined by y^2=x^2y+x^5. (1) It has a ramphoid cusp at the origin, horizontal tangents at (0,0) and (-6/(25),(108)/(3125)), and a ...

A plane curve proposed by Descartes to challenge Fermat's extremum-finding techniques. In parametric form, x = (3at)/(1+t^3) (1) y = (3at^2)/(1+t^3). (2) The curve has a ...

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

Graph Strength

The Cassini ovals are a family of quartic curves, also called Cassini ellipses, described by a point such that the product of its distances from two fixed points a distance ...

The term multigraph refers to a graph in which multiple edges between nodes are either permitted (Harary 1994, p. 10; Gross and Yellen 1999, p. 4) or required (Skiena 1990, ...