Search Results for ""
31 - 40 of 13135 for Use of graphing calculatorsSearch Results
View search results from all Wolfram sites (105877 matches)A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...
A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...
Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their ...
Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.
The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.
The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.
The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.
The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.
A graph vertex in a graph is said to be an odd node if its vertex degree is odd.
A three-colorable graph G is a graph with chromatic number chi(G)<=3.
...