Search for "Graphs" in article titles:

1. Graphs with few cliques: In graph theory, a class of graphs is said to have few cliques if every member of the class has a polynomial number of maximal cliques. Certain generally NP-hard computational problems are solvable in polynomial time on such classes ... [100%] 2024-08-06 [Graph theory] [Discrete mathematics]...
2. The Strange Logic of Random Graphs: The Strange Logic of Random Graphs is a book on zero-one laws for random graphs. It was written by Joel Spencer and published in 2001 by Springer-Verlag as volume 22 of their book series Algorithms and Combinatorics. [81%] 2023-02-21 [Random graphs] [Finite model theory]...
3. Chang graphs: In the mathematical field of graph theory, the Chang graphs are a set of three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly regular, with the same parameters and spectra as the line graph ... [100%] 2023-11-11 [Individual graphs] [Regular graphs]...
4. Climate graphs: Climate graphs show average rainfall and temperatures at a specific location . What can you tell me from looking at the graph ?. [100%] 2023-12-29 [Meteorology] [Climate]...
5. Chang graphs: In the mathematical field of graph theory, the Chang graphs are three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly regular, with the same parameters and spectrum as the line graph L(K8) of ... [100%] 2023-12-29 [Individual graphs] [Regular graphs]...
6. Signal transition graphs: Signal Transition Graphs (STGs) are typically used in electronic engineering and computer engineering to describe dynamic behaviour of asynchronous circuits, for the purposes of their analysis or synthesis. Informally, an STG is a graphical description of the behaviour of an ... [81%] 2022-12-04 [Automata (computation)]
7. List of graphs: Balaban 10-cage Balaban 11-cage Bidiakis cube Brinkmann graph Bull graph Butterfly graph Chvátal graph Diamond graph Dürer graph Ellingham–Horton 54-graph Ellingham–Horton 78-graph Errera graph Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch ... (none) [81%] 2023-12-08 [Mathematics-related lists] [Graphs]...
8. Logic of graphs: In the mathematical fields of graph theory and finite model theory, the logic of graphs deals with formal specifications of graph properties using sentences of mathematical logic. There are several variations in the types of logical operation that can be ... (Logical formulation of graph properties) [81%] 2023-10-25 [Graph theory] [Finite model theory]...
9. Disjoint union of graphs: In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph. It is analogous to the disjoint union of sets, and is constructed by making ... (Combining the vertex and edge sets of two graphs) [70%] 2023-12-28 [Graph operations]
10. Lévy family of graphs: In graph theory, a branch of mathematics, a Lévy family of graphs is a family of graphs Gn, n = 1, 2, 3, ..., which possess a certain type of "compactness" or "tangledness". Many naturally occurring families of graphs are Lévy families. [70%] 2023-10-27 [Graph families]
11. Motion graphs and derivatives: In mechanics, the derivative of the position vs. time graph of an object is equal to the velocity of the object. (Physics) [70%] 2023-09-27 [Classical mechanics]
12. Calculus on finite weighted graphs: In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges. This involves formulating discrete operators on ... [63%] 2023-08-23 [Calculus] [Graph theory]...
13. Fabricating and running orchestration graphs: Fabricating and running orchestration graphs (FROG) is an integrated environment to implement learning scenarios as defined by orchestration graphs. It is developed by Stian Håklev and collaborators. [63%] 2024-01-11 [Collaborative learning] [Computer-mediated communication]...
14. Differentially private analysis of graphs: Differentially private analysis of graphs studies algorithms for computing accurate graph statistics while preserving differential privacy. Such algorithms are used for data represented in the form of a graph where nodes correspond to individuals and edges correspond to relationships between ... [63%] 2023-08-19 [Information privacy] [Differential privacy]...
15. Phase-field models on graphs: Phase-field models on graphs are a discrete analogue to phase-field models, defined on a graph. They are used in image analysis (for feature identification) and for the segmentation of social networks. (Graph-based mathematical model) [63%] 2024-06-25 [Graph theory] [Mathematical modeling]...