Search Results for ""
61 - 70 of 13134 for Graph TheorySearch Results
View search results from all Wolfram sites (33872 matches)A graph that is not finite is called infinite.
The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...
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 ...
The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...
The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].
The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...
The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...
The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...
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 mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...
...