Search Results for ""

An n-component of a graph G is a maximal n-connected subgraph.

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

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 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 ...

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 ...