💡 Words with a Similar Meaning to "Utility graph"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| graphnoun | (applied mathematics, statistics) A data chart (graphical representation of data) intended to illustrate the relationship between a set (or sets) of numbers (quantities, measurements or indicative numbers) and a reference set, whose elements are indexed to those of the former set(s) and may or may not be numbers. |
| cubic graphnoun | (graph theory) A 3-regular graph; i.e., a graph whose every vertex has degree three. |
| graph theorynoun | (uncountable, mathematics) The branch of mathematics dealing with the properties of graphs (networks of vertices and edges). |
| hypergraphnoun | (graph theory) A generalization of a graph, in which edges can connect any number of vertices. |
| multigraphnoun | (graph theory) A set V (whose elements are called vertices or nodes), taken together with a multiset E, each of whose elements (called an edge or line) is a cardinality-two multisubset of V. |
| complete graphnoun | (graph theory) A graph where every pair of vertices is connected by an edge. |
| rectagraphnoun | (graph theory) A triangle-free connected graph where any two vertices have 0 or 2 common neighbors. |
| multihypergraphnoun | (graph theory) A set V (whose elements are called vertices or nodes), taken together with a multiset E, each of whose elements (called an edge or hyperedge) is a subset of V. |
| crown graphnoun | (graph theory) An undirected graph with 2n vertices in the two sets { u₁, u₂, ..., uₙ } and { v₁, v₂, ..., vₙ } and with an edge from uᵢ to vⱼ whenever i ≠ j. |
| spider graphnoun | (mathematics) A graph (set of connected points) that has one vertex of degree at least three, and all other vertices of degree two or less |
| ordernoun | (countable) A command. |
| regular graphnoun | (graph theory) A graph whose vertices all have the same degree. |
| connected graphnoun | (graph theory) A graph in which there is a route of edges and nodes connecting any two nodes. |
| desargues graphnoun | (graph theory) A distance-transitive cubic graph with 20 vertices and 30 edges. |
| directed graphnoun | (graph theory) A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is. |
| coxeter graphnoun | (graph theory) A 3-regular graph with 28 vertices and 42 edges, one of the 13 known cubic distance-regular graphs. |
| edge covernoun | (graph theory) A set of edges which touch all the vertices of a graph. |
| heawood graphnoun | (graph theory) An undirected graph with 14 vertices and 21 edges. |
| keller graphnoun | (geometry) Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate. |
| sizenoun | The dimensions or magnitude of a thing; how big something is. |
Translate “Utility graph” into Another Language
Pick a language — the word will be pre-filled in the translator.