Search Results for ""
31 - 40 of 4141 for Non Line Graphs_ 800Search Results
View search results from all Wolfram sites (39200 matches)Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...
De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...
Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...
A transversal line is a line which intersects each of a given set of other lines. It is also called a semisecant.
A line making equal angles with the edges of a trihedron is called an isoclinal line of the trihedron.
The line bisecting a given line segment P_1P_2 can be constructed geometrically, as illustrated above.
A line that passes through the center of a circle or sphere.
The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...
A line bundle is a special case of a vector bundle in which the fiber is either R, in the case of a real line bundle, or C, in the case of a complex line bundle.
A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...
...