35 relations: Adjacency algebra, Adjacency matrix, Association scheme, Biggs–Smith graph, Bose–Mesner algebra, Characteristic polynomial, Complete bipartite graph, Complete graph, Coxeter graph, Cubic graph, Cycle graph, Desargues graph, Distance (graph theory), Distance-transitive graph, Foster graph, Graph (discrete mathematics), Graph automorphism, Graph operations, Heawood graph, Hypercube graph, Mathematics, Minimal polynomial (linear algebra), Moore graph, Odd graph, Pappus graph, Petersen graph, Regular graph, Spectral graph theory, Strongly regular graph, Sylvester graph, Tetrahedron, Tridiagonal matrix, Tutte 12-cage, Tutte–Coxeter graph, Wells graph.
Adjacency algebra
In algebraic graph theory, the adjacency algebra of a graph G is the algebra of polynomials in the adjacency matrix A(G) of the graph.
New!!: Distance-regular graph and Adjacency algebra · See more »
Adjacency matrix
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph.
New!!: Distance-regular graph and Adjacency matrix · See more »
Association scheme
The theory of association schemes arose in statistics, in the theory of experimental design for the analysis of variance.
New!!: Distance-regular graph and Association scheme · See more »
Biggs–Smith graph
In the mathematical field of graph theory, the Biggs–Smith graph is a 3-regular graph with 102 vertices and 153 edges.
New!!: Distance-regular graph and Biggs–Smith graph · See more »
Bose–Mesner algebra
In mathematics, a Bose–Mesner algebra is a special set of matrices which arise from a combinatorial structure known as an association scheme, together with the usual set of rules for combining (forming the products of) those matrices, such that they form an associative algebra, or, more precisely, a unitary commutative algebra.
New!!: Distance-regular graph and Bose–Mesner algebra · See more »
Characteristic polynomial
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots.
New!!: Distance-regular graph and Characteristic polynomial · See more »
Complete bipartite graph
No description.
New!!: Distance-regular graph and Complete bipartite graph · See more »
Complete graph
No description.
New!!: Distance-regular graph and Complete graph · See more »
Coxeter graph
In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges.
New!!: Distance-regular graph and Coxeter graph · See more »
Cubic graph
In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three.
New!!: Distance-regular graph and Cubic graph · See more »
Cycle graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain.
New!!: Distance-regular graph and Cycle graph · See more »
Desargues graph
In the mathematical field of graph theory, the Desargues graph is a distance-transitive cubic graph with 20 vertices and 30 edges.
New!!: Distance-regular graph and Desargues graph · See more »
Distance (graph theory)
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them.
New!!: Distance-regular graph and Distance (graph theory) · See more »
Distance-transitive graph
In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y.
New!!: Distance-regular graph and Distance-transitive graph · 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!!: Distance-regular 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!!: Distance-regular 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!!: Distance-regular graph and Graph automorphism · See more »
Graph operations
Graph operations produce new graphs from initial ones.
New!!: Distance-regular graph and Graph operations · See more »
Heawood graph
In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood.
New!!: Distance-regular graph and Heawood graph · See more »
Hypercube graph
In graph theory, the hypercube graph is the graph formed from the vertices and edges of an -dimensional hypercube.
New!!: Distance-regular graph and Hypercube graph · 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!!: Distance-regular graph and Mathematics · See more »
Minimal polynomial (linear algebra)
In linear algebra, the minimal polynomial of an matrix over a field is the monic polynomial over of least degree such that.
New!!: Distance-regular graph and Minimal polynomial (linear algebra) · See more »
Moore graph
In graph theory, a Moore graph is a regular graph of degree d and diameter k whose number of vertices equals the upper bound An equivalent definition of a Moore graph is that it is a graph of diameter k with girth 2k + 1.
New!!: Distance-regular graph and Moore graph · See more »
Odd graph
In the mathematical field of graph theory, the odd graphs On are a family of symmetric graphs with high odd girth, defined from certain set systems.
New!!: Distance-regular graph and Odd graph · See more »
Pappus graph
In the mathematical field of graph theory, the Pappus graph is a bipartite 3-regular undirected graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration.
New!!: Distance-regular graph and Pappus graph · See more »
Petersen graph
In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges.
New!!: Distance-regular graph and Petersen graph · 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!!: Distance-regular 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!!: Distance-regular graph and Spectral graph theory · See more »
Strongly regular graph
In graph theory, a strongly regular graph is defined as follows.
New!!: Distance-regular graph and Strongly regular graph · See more »
Sylvester graph
The Sylvester graph is the unique distance-regular graph with intersection array \. It is a subgraph of the Hoffman–Singleton graph.
New!!: Distance-regular graph and Sylvester graph · See more »
Tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners.
New!!: Distance-regular graph and Tetrahedron · See more »
Tridiagonal matrix
In linear algebra, a tridiagonal matrix is a band matrix that has nonzero elements only on the main diagonal, the first diagonal below this, and the first diagonal above the main diagonal.
New!!: Distance-regular graph and Tridiagonal matrix · See more »
Tutte 12-cage
In the mathematical field of graph theory, the Tutte 12-cage or Benson graph is a 3-regular graph with 126 vertices and 189 edges named after W. T. Tutte.
New!!: Distance-regular graph and Tutte 12-cage · See more »
Tutte–Coxeter graph
In the mathematical field of graph theory, the Tutte–Coxeter graph or Tutte eight-cage is a 3-regular graph with 30 vertices and 45 edges.
New!!: Distance-regular graph and Tutte–Coxeter graph · See more »
Wells graph
The Wells graph is the unique distance-regular graph with intersection array \..
New!!: Distance-regular graph and Wells graph · See more »
Redirects here:
Distance regular graph, Distance-regular graphs, Intersection Array, Intersection array.
References
[1] https://en.wikipedia.org/wiki/Distance-regular_graph