TOPICS
Search

Search Results for ""


811 - 820 of 4141 for Non Line Graphs_ 800Search Results
A correspondence between two line segment ranges that are sections of one pencil by two distinct lines.
The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...
Two sextuples of skew lines on the general cubic surface such that each line of one is skew to one line in the other set. In all, there are 30 points, with two lines through ...
The initial side of an angle theta drawn in angle standard position is the side lying on the positive x-axis. In general, viewing an angle as the amount of rotation about the ...
The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...
A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...
The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...
Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...
The Poincaré hyperbolic disk is a two-dimensional space having hyperbolic geometry defined as the disk {x in R^2:|x|<1}, with hyperbolic metric ...
The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...
1 ... 79|80|81|82|83|84|85 ... 415 Previous Next

...