Search Results for ""
21 - 30 of 2230 for Triangular Graph GraphSearch Results
A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...
An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...
A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...
An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.
A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...
The complete bipartite graph K_(1,3) is a tree known as the "claw." It is isomorphic to the star graph S_4, and is sometimes known as the Y graph (Horton and Bouwer 1991; ...
The cube of a graph is defined as its third graph power.
"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...
A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...
The Reye graph is the transposition graph G_4 of order 4.
...