Faster access than browser!
23 relations: Characteristic polynomial, Complete graph, Cycle graph, Dihedral group, Distance (graph theory), Edge coloring, Edge contraction, Eulerian path, Friendship graph, Girth (graph theory), Graceful labeling, Graph (discrete mathematics), Graph coloring, Graph theory, Induced subgraph, K-edge-connected graph, K-vertex-connected graph, Ken-ichi Kawarabayashi, Mathematics, Planar graph, Square, Triangle-free graph, Unit distance graph.
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!!: Butterfly graph and Characteristic polynomial · See more »
Complete graph
No description.
New!!: Butterfly graph and Complete 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!!: Butterfly graph and Cycle graph · See more »
Dihedral group
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections.
New!!: Butterfly graph and Dihedral group · 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!!: Butterfly graph and Distance (graph theory) · See more »
Edge coloring
In graph theory, an edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two adjacent edges have the same color.
New!!: Butterfly graph and Edge coloring · See more »
Edge contraction
In graph theory, an edge contraction is an operation which removes an edge from a graph while simultaneously merging the two vertices that it previously joined.
New!!: Butterfly graph and Edge contraction · 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!!: Butterfly graph and Eulerian path · See more »
Friendship graph
In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar undirected graph with 2n+1 vertices and 3n edges.
New!!: Butterfly graph and Friendship graph · See more »
Girth (graph theory)
In graph theory, the girth of a graph is the length of a shortest cycle contained in the graph.
New!!: Butterfly graph and Girth (graph theory) · See more »
Graceful labeling
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference between its endpoints, such that this magnitude lies between 1 and m inclusive.
New!!: Butterfly graph and Graceful labeling · 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!!: Butterfly graph and Graph (discrete mathematics) · See more »
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
New!!: Butterfly graph and Graph coloring · 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!!: Butterfly graph and Graph theory · See more »
Induced subgraph
In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset.
New!!: Butterfly graph and Induced subgraph · See more »
K-edge-connected graph
In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.
New!!: Butterfly graph and K-edge-connected graph · See more »
K-vertex-connected graph
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.
New!!: Butterfly graph and K-vertex-connected graph · See more »
Ken-ichi Kawarabayashi
Ken-ichi Kawarabayashi (河原林 健一, born 1975) is a Japanese graph theorist who works as a professor at the National Institute of Informatics and is known for his research on graph theory (particularly the theory of graph minors) and graph algorithms.
New!!: Butterfly graph and Ken-ichi Kawarabayashi · 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!!: Butterfly graph and Mathematics · See more »
Planar graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints.
New!!: Butterfly graph and Planar graph · See more »
Square
In geometry, a square is a regular quadrilateral, which means that it has four equal sides and four equal angles (90-degree angles, or (100-gradian angles or right angles). It can also be defined as a rectangle in which two adjacent sides have equal length. A square with vertices ABCD would be denoted.
New!!: Butterfly graph and Square · See more »
Triangle-free graph
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges.
New!!: Butterfly graph and Triangle-free graph · See more »
Unit distance graph
In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one.
New!!: Butterfly graph and Unit distance graph · See more »
Redirects here:
Bowtie graph, Bowtie-free graph, Bowtie-free graphs, Hourglass graph.
References
[1] https://en.wikipedia.org/wiki/Butterfly_graph
