Search results
Results from the WOW.Com Content Network
The Petersen graph is a well known non-Hamiltonian graph, but all odd graphs for are known to have a Hamiltonian cycle. [17] As the odd graphs are vertex-transitive , they are thus one of the special cases with a known positive answer to Lovász' conjecture on Hamiltonian cycles in vertex-transitive graphs.
Graph pebbling is a mathematical game played on a graph with zero or more pebbles on each of its vertices. 'Game play' is composed of a series of pebbling moves. A pebbling move on a graph consists of choosing a vertex with at least two pebbles, removing two pebbles from it, and adding one to an adjacent vertex (the second removed pebble is discarded from play). π(G), the pebbling number of a ...
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
See Families of sets for related families of non-graph combinatorial objects, graphs for individual graphs and graph families parametrized by a small number of numeric parameters, and graph theory for more general information about graph theory. See also Category:Graph operations for graphs distinguished for the specific way of their construction
It was proved for specific types of graphs, such as wheels, [8] complete graphs, [9] complete bipartite graphs, and graphs with a local symmetry. [10] It was also proved in the limit p → 1 for any graph. [11] [12] Counterexamples for generalizations of the bunkbed conjecture have been published for site percolation, hypergraphs, and directed ...
The graph coloring game is a mathematical game related to graph theory. Coloring game problems arose as game-theoretic versions of well-known graph coloring problems. In a coloring game, two players use a given set of colors to construct a coloring of a graph , following specific rules depending on the game we consider.
A typical, basic example is as follows (cops and robber games): Pursuers and evaders occupy nodes of a graph. The two sides take alternate turns, which consist of each member either staying put or moving along an edge to an adjacent node. If a pursuer occupies the same node as an evader the evader is captured and removed from the graph.
Game theory is a branch of mathematics that uses models to study interactions with formalized incentive structures ("games"). It has applications in a variety of fields, including economics, anthropology, political science, social psychology and military strategy. Glossary of game theory; List of games in game theory