Faster access than browser!
20 relations: Cayley graph, Eulerian path, Foster graph, Graph (discrete mathematics), Graph automorphism, Graph theory, Hamiltonian path, Independent set (graph theory), Index of a subgroup, Integral graph, Janko group J2, Marshall Hall (mathematician), Mathematics, Rank 3 permutation group, Regular graph, Spectral graph theory, Steiner system, Strongly regular graph, Vertex-transitive graph, Zvonimir Janko.
Cayley graph
In mathematics, a Cayley graph, also known as a Cayley colour graph, Cayley diagram, group diagram, or colour group is a graph that encodes the abstract structure of a group.
New!!: Hall–Janko graph and Cayley graph · See more »
Eulerian path
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph which visits every edge exactly once.
New!!: Hall–Janko graph and Eulerian path · See more »
Foster graph
In the mathematical field of graph theory, the Foster graph is a bipartite 3-regular graph with 90 vertices and 135 edges.
New!!: Hall–Janko graph and Foster graph · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Hall–Janko graph and Graph (discrete mathematics) · See more »
Graph automorphism
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity.
New!!: Hall–Janko graph and Graph automorphism · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Hall–Janko graph and Graph theory · See more »
Hamiltonian path
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once.
New!!: Hall–Janko graph and Hamiltonian path · See more »
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent.
New!!: Hall–Janko graph and Independent set (graph theory) · See more »
Index of a subgroup
In mathematics, specifically group theory, the index of a subgroup H in a group G is the "relative size" of H in G: equivalently, the number of "copies" (cosets) of H that fill up G. For example, if H has index 2 in G, then intuitively half of the elements of G lie in H. The index of H in G is usually denoted |G: H| or or (G:H).
New!!: Hall–Janko graph and Index of a subgroup · See more »
Integral graph
In the mathematical field of graph theory, an integral graph is a graph whose spectrum consists entirely of integers.
New!!: Hall–Janko graph and Integral graph · See more »
Janko group J2
In the area of modern algebra known as group theory, the Janko group J2 or the Hall-Janko group HJ is a sporadic simple group of order.
New!!: Hall–Janko graph and Janko group J2 · See more »
Marshall Hall (mathematician)
Marshall Hall, Jr. (17 September 1910 – 4 July 1990) was an American mathematician who made significant contributions to group theory and combinatorics.
New!!: Hall–Janko graph and Marshall Hall (mathematician) · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Hall–Janko graph and Mathematics · See more »
Rank 3 permutation group
In mathematical finite group theory, a rank 3 permutation group acts transitively on a set such that the stabilizer of a point has 3 orbits.
New!!: Hall–Janko graph and Rank 3 permutation group · See more »
Regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.
New!!: Hall–Janko graph and Regular graph · See more »
Spectral graph theory
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian matrix.
New!!: Hall–Janko graph and Spectral graph theory · See more »
Steiner system
The Fano plane is an S(2,3,7) Steiner triple system. The blocks are the 7 lines, each containing 3 points. Every pair of points belongs to a unique line. In combinatorial mathematics, a Steiner system (named after Jakob Steiner) is a type of block design, specifically a t-design with λ.
New!!: Hall–Janko graph and Steiner system · See more »
Strongly regular graph
In graph theory, a strongly regular graph is defined as follows.
New!!: Hall–Janko graph and Strongly regular graph · See more »
Vertex-transitive graph
In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism such that In other words, a graph is vertex-transitive if its automorphism group acts transitively upon its vertices.
New!!: Hall–Janko graph and Vertex-transitive graph · See more »
Zvonimir Janko
Zvonimir Janko (born 26 November 1932) is a Croatian mathematician who is the eponym of the Janko groups, sporadic simple groups in group theory.
New!!: Hall–Janko graph and Zvonimir Janko · See more »
Redirects here:
Hall-Janko graph, Hall-Janko-Wales graph, Hall–Janko-Wales graph, Hall–Janko–Wales graph.
