In the mathematics of graph theory and finite groups, a prime graph is an undirected graph defined from a group. These graphs were introduced in a 1981...

induced subgraph of a graph G for vertex subset S. Prime symbol ' The prime symbol is often used to modify notation for graph invariants so that it applies...

The HP Prime Graphing Calculator is a graphing calculator introduced by Hewlett-Packard in 2013 and manufactured by HP Inc. until the licensees Moravia...

In graph theory, a split of an undirected graph is a cut whose cut-set forms a complete bipartite graph. A graph is prime if it has no splits. The splits...

spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are...

Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic...

In graph theory, the Cartesian product G □ H of graphs G and H is a graph such that: the vertex set of G □ H is the Cartesian product V(G) × V(H); and...

rise to the same permutation graph; a given graph has a unique representation (up to permutation symmetry) if it is prime with respect to the modular decomposition...

In graph theory, all graphs with four or fewer vertices are planar, however, there is a graph with five vertices that is not: K5, the complete graph with...

combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...

In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes...

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...

a Ph.D. at Padua in 1996 with the dissertation Il Prime Graph dei gruppi finiti [the prime graphs of finite groups], supervised by Napolitani and co-advised...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and...

mathematics In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning...

modules. A graph is prime if all its modules are trivial. Connected components of a graph G {\displaystyle G} , or of its complement graph are also modules...

In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract...

graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is a doubly infinite path graph. However, Cayley graphs can...

the prime zeta function". arXiv:0811.4739 [math.NT]. Li, Ji (2008). "Prime graphs and exponential composition of species". Journal of Combinatorial Theory...

of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v − 1)/4. It is the graph associated...

well-connected. Consider, for example, the following graph: Three communities are present in this graph (each color represents a community). Additionally...

of graph theory, a cage is a regular graph that has as few vertices as possible for its girth. Formally, an (r, g)-graph is defined to be a graph in which...

{\displaystyle G=(V,E)} , H = ( V ′ , E ′ ) {\displaystyle H=(V^{\prime },E^{\prime })} be graphs. Is there a subgraph G 0 = ( V 0 , E 0 ) ∣ V 0 ⊆ V , E 0 ⊆...

the graph distance-transitive). For rectangular chessboards whose width and height are relatively prime, the rook's graphs are circulant graphs. With...

A graphing calculator (also graphics calculator or graphic display calculator) is a handheld computer that is capable of plotting graphs, solving simultaneous...

chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation...

number and the eighth square-prime. 68 is a composite number; a square-prime, of the form (p2, q) where q is a higher prime. It is the eighth of this form...

HP 50g graphing calculator user's guide (UG) (1 ed.). Hewlett-Packard. 2006-04-01. HP F2229AA-90006. Retrieved 2015-10-10. HP Prime Graphing Calculator...

cycle graph of a group is an undirected graph that illustrates the various cycles of that group, given a set of generators for the group. Cycle graphs are...