The Sylvester graph is the unique distance-regular graph with intersection array { 5 , 4 , 2 ; 1 , 1 , 4 } {\displaystyle \{5,4,2;1,1,4\}} . It is a subgraph...

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some...

of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with...

Horton graph Kittell graph Markström graph McGee graph Meredith graph Moser spindle Sousselier graph Poussin graph Robertson graph Sylvester graph Tutte's...

regular near polygon. The Wells graph and the Sylvester graph. Strongly regular graphs are the distance-regular graphs of diameter 2. There are only finitely...

James Joseph Sylvester (3 September 1814 – 15 March 1897) was an English mathematician. He made fundamental contributions to matrix theory, invariant...

computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

mathematical field of graph theory, the Tutte–Coxeter graph or Tutte eight-cage or Cremona–Richmond graph is a 3-regular graph with 30 vertices and 45...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

Sylvester James Gates Jr. (born December 15, 1950), known as S. James Gates Jr. or Jim Gates, is an American theoretical physicist who works on supersymmetry...

Consequently, there are different terminologies to describe these objects. In graph theory they are called hypergraphs, and in combinatorial design theory they...

The Sylvester–Gallai theorem in geometry states that every finite set of points in the Euclidean plane has a line that passes through exactly two of the...

Murty (1970) Matroids with Sylvester property. Aequationes Mathematicae. Murty, U. S. R. (1968), "On some extremal graphs", Acta Mathematica Academiae...

graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. For instance, a graph is...

also the dual configuration of complete bipartite graph, K3,3, called the utility graph (or Thomsen graph), (63 92) or [ 6 3 2 9 ] {\displaystyle...

sequence to be the degree sequence of a graph, known as the Erdős–Gallai theorem. Gallai–Hasse–Roy–Vitaver theorem Sylvester–Gallai theorem Gallais-Edmonds decomposition...

Sylvester (late 19th century) and Percy MacMahon (early 20th century) helped lay the foundation for enumerative and algebraic combinatorics. Graph theory...

in geometry and group theory are named after him, including the Coxeter graph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin...

what is now called graph theory was suggested by the mathematician J. J. Sylvester in 1878. He was the first to use the word "graph" in the sense of a...

the same year Richelot uses the term Normalform in a paper, and in 1851 Sylvester writes: "I now proceed to [...] the mode of reducing Algebraical Functions...

state that J. J. Sylvester coined the mathematical term "matrix" in 1848, Sylvester published nothing in 1848. (For proof that Sylvester published nothing...

that provides just the vector and matrix math utilities for shaders is sylvester.js. It is sometimes used in conjunction with a WebGL specific extension...

later in a paper by J. J. Sylvester (1883). Sometimes the principle is referred to as the formula of Da Silva or Sylvester, due to these publications...

Bookelgouna. Retrieved 2015-09-17. "Climate: El Gouna - Climate graph, Temperature graph, Climate table". Climate-Data.org. Retrieved 18 August 2013. Wikimedia...

twin-width of an undirected graph is a natural number associated with the graph, used to study the parameterized complexity of graph algorithms. Intuitively...

geometry) Steinitz theorem (graph theory) Stewart's theorem (plane geometry) Supporting hyperplane theorem (convex geometry) Sylvester–Gallai theorem (plane...

determinants of smaller ones. Pozrikidis, C. (2014), An Introduction to Grids, Graphs, and Networks, Oxford University Press, p. 271, ISBN 9780199996735 "The...

Mathematically they can be described as colored finite connected simple graphs, that are bipartite and n-regular. Their name is derived from Adinkra symbols...

applications in chemistry (Sylvester, 1878). Dénes Kőnig, a Hungarian mathematician and professor, wrote the first book in Graph Theory, entitled "Theory...

they are closely related to regular hypergraphs and biregular bipartite graphs, but with some additional restrictions: every two points of the incidence...