Search Results for ""
401 - 410 of 2264 for Vertex transitive graphSearch Results
View search results from all Wolfram sites (14104 matches)The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...
The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].
Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...
The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...
A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...
The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...
The number of nodes in a graph is called its order.
The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].
The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].
The domino graph is the graph on 6 vertices illustrated above. It is isomorphic to the 3-ladder graph and the (2,3)-grid graph. It is implemented in the Wolfram Language as ...
...