TOPICS
Search

Search Results for ""


991 - 1000 of 1812 for Cayley graphsSearch Results
The cyclic group C_(11) is unique group of group order 11. An example is the integers modulo 11 under addition (Z_(11)). No modulo multiplication group is isomorphic to ...
C_3 is the unique group of group order 3. It is both Abelian and cyclic. Examples include the point groups C_3, C_(3v), and C_(3h) and the integers under addition modulo 3 ...
C_5 is the unique group of group order 5, which is Abelian. Examples include the point group C_5 and the integers mod 5 under addition (Z_5). No modulo multiplication group ...
C_7 is the cyclic group that is the unique group of group order 7. Examples include the point group C_7 and the integers modulo 7 under addition (Z_7). No modulo ...
An extremum is a maximum or minimum. An extremum may be local (a.k.a. a relative extremum; an extremum in a given region which is not the overall maximum or minimum) or ...
The Kirchhoff index Kf, also simply called the resistance and denoted R (Lukovits et al. 1999), of a connected graph G on n nodes is defined by ...
A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...
The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.
A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.
The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...
1 ... 97|98|99|100|101|102|103 ... 182 Previous Next

...