Search results

{{about|graphs defined from finite groups|other uses|Glossary of graph theory#prime}} ...n [[undirected graph]] defined from a [[Group (mathematics)|group]]. These graphs were introduced in a 1981 paper by J. S. Williams, credited to unpublished ...

...strictions of relative movements of the objects placed in the plane. These graphs, while sharing common idea, have different definition, depending on a parti A possible definition of constraint graphs is as follows. The constraint graph for a given floorplan is a [[directed g ...

...rst1=M. A. |last2=Pevzner |first2=P. A. |date=2009-02-13 |title=Breakpoint graphs and ancestral genome reconstructions |journal=Genome Research |publisher=Co ...is labeled as BreakpointGraph(''P, Q'').<ref>{{Citation |title=Breakpoint Graphs | date=19 May 2014 |url=https://www.youtube.com/watch?v=nrCG6P3I2BI |langua ...

{{short description|Class of expander graphs arising in computational number theory}} In mathematics, the '''supersingular isogeny graphs''' are a class of [[expander graph]]s that arise in [[computational number ...

The only [[cycle graph]]s that can be realized as zero-product graphs (with zero divisors as vertices) are the cycles of length 3 or 4.{{r|al}} ...o-divisor graphs are the [[star (graph theory)|stars]] (complete bipartite graphs that are trees) and the five-vertex tree formed as the zero-divisor graph o ...

'''Configuration graphs''' are a theoretical tool used in [[computational complexity theory]] to pr It is also possible to have finite graphs: on [[Deterministic finite automaton]] with <math>s</math> states, for a gi ...

==Related graphs== | title = Integral Cayley graphs over abelian groups ...

...quasirandom group are always bipartite [[pseudorandom graph | quasirandom graphs]]. ...Vera T. Sós | title = Sidon sets in groups and induced subgraphs of Cayley graphs| journal = [[European Journal of Combinatorics]] | volume = 6 | year =1985 ...

{{For|flow graph in computer science|Control-flow graph|Rooted graph#Flow graphs|Flowchart}} ...the Mason graph and the Coates graph, and a variety of other forms of such graphs<ref name=Murota/> appears useful, and agrees with Abrahams and Coverley's a ...

|title=Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution ...ph]], but rather the entropy of the whole probabilistic ensemble of random graphs. ...

...atically learned [[basis function]]s that are useful in approximating task-specific value functions, providing a compact representation of the powers of transi ...du/~pvf/papers/johns_icml07.pdf Constructing Basis Functions from Directed Graphs for Value Function Approximation], International Conference on Machine Lear ...

...t of as a [[Lossless data compression|lossless compression algorithm]] for graphs.<ref name="Reimann2015"/> It extends graph syntax with representations of [ ...ot another generalization of graphs, but instead a novel representation of graphs that proposes a shift from the "node and edge" language to one using clique ...

...ollaborative relationship between them of a particular kind. Collaboration graphs are used to measure the closeness of collaborative relationships between th The most well-studied collaboration graphs include: ...

Mean first passage time is not symmetric, even for undirected graphs. ...erson to another through transactions, without any intention of reaching a specific individual. ...

...asic idea behind assemblies is to consider sets (such as the set of finite graphs, modulo isomorphism) where each element has a number of ''realizers'', whic ...uring thesis|Church–Turing sense]]. Instead, assemblies are defined over a specific [[partial combinatory algebra]], which abstracts the model of computation. ...

...the editing and composition (or linking) of atomic functional units. Node graphs are a type of [[visual programming language]]. The [[source code]] for the [[Application software|software application]] is organized into atomic functional units called nodes. This is typically ...

[[File:Flip_graphs.svg|The flip graphs of a quadrilateral (top-left), a pentagon (top-right), and a hexagon (botto ...flip. Flip graphs are special cases of [[Geometric graph theory|geometric graphs]]. ...

...aphs representing the bracing problem, but finding them in other bipartite graphs is [[NP-complete]]. Because of this, finding the smallest double braced sub ...acing, the smallest tension bracings (equivalently, the strongly connected graphs with as few edges as possible) in grids with equally many rows and columns ...

...presentation language]]. AMR graphs are rooted, labeled, directed, acyclic graphs ([[Directed acyclic graph|DAGs]]), comprising whole sentences. They are int ...n|Natural Language Generation]] and this has been their original domain of application. AMRs have re-gained attention since Banarescu et al. (2013),<ref name=":0" ...

| title=Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing ...o we have <math>t(H,G)=d(H,G)+O(1/n)</math>. For instance, we see that for graphs with constant homomorphism density, the labeled subgraph density and homomo ...