Search Results for ""
11 - 20 of 13134 for Graph TheorySearch Results
View search results from all Wolfram sites (33872 matches)Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...
The Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...
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 cube of a graph is defined as its third graph power.
The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].
An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...
"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...
The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...
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 whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...
...