Search results
Jump to navigation
Jump to search
Page title matches
- ...imilarity measure|measure of similarity]] (or dissimilarity) between two [[Graph (discrete mathematics)|graphs]]. The concept of graph edit distance was first formalized mathematically by Alberto Sanfeliu and King-Sun Fu in ...13 KB (1,723 words) - 03:20, 8 February 2025
Page text matches
- {{Infobox graph | name = Sylvester graph ...1,018 bytes (110 words) - 01:29, 22 April 2024
- {{Infobox graph | name = Wells graph ...1 KB (135 words) - 20:54, 15 May 2024
- {{One source|date=July 2024}}{{Distinguish|Triangular graph|Ternary plot}} {{infobox graph ...1 KB (187 words) - 23:14, 7 July 2024
- ...matic Graph Theory |year=2009 |publisher=CRC Press |chapter=14. Colorings, Distance, and Domination |pages=397–438}}</ref> It has many applications in differen ...colors") is greater than k. For example, two nodes labelled 3 and 7 with a distance of 5 is acceptable for a radio 8-coloring, but not for a radio 9-coloring, ...3 KB (413 words) - 19:03, 11 August 2023
- {{Infobox graph | name = Gewirtz graph ...2 KB (244 words) - 04:27, 16 August 2019
- {{infobox graph | name = Hoffman graph ...3 KB (382 words) - 15:56, 7 October 2024
- '''Min-plus matrix multiplication''', also known as '''distance product''', is an operation on [[matrix (mathematics)|matrices]]. ...h> matrices <math>A = (a_{ij})</math> and <math>B = (b_{ij})</math>, their distance product <math>C = (c_{ij}) = A \star B</math> is defined as an <math>n \tim ...1 KB (216 words) - 08:40, 18 November 2024
- {{Short description|Cubic distance-regular graph with 102 nodes and 153 edges}} {{infobox graph ...3 KB (482 words) - 02:19, 23 February 2024
- {{Short description|Graph with all path lengths between each two vertices}} ...math>n-1</math>, where <math>n</math> is the number of vertices. Thus, the graph shown is panconnected.]] ...3 KB (393 words) - 05:25, 2 February 2025
- {{Short description|Mathematical Graph}} ...thought of as a [[spectral graph theory]] analogue of [[vertex-transitive graph]]s. ...4 KB (638 words) - 20:58, 2 December 2024
- {{short description|Undirected unit-distance graph requiring four colors}} {{infobox graph ...4 KB (504 words) - 23:02, 3 November 2023
- {{Infobox graph |name=Grassmann graph ...4 KB (574 words) - 03:45, 30 December 2024
- {{infobox graph | image = [[File:E7 graph.svg|241px]] ...4 KB (556 words) - 18:28, 11 December 2024
- ...circle or sphere; more generally the [[diameter of a set]] is the longest distance between two of its points. * [[Diameter (computational geometry)]], the problem of computing the longest distance between two of <math>n</math> given points or of the points in a polygon ...2 KB (285 words) - 06:39, 9 January 2025
- {{infobox graph | name = F26A graph ...4 KB (552 words) - 09:20, 3 October 2019
- {{Short description|Undirected graph with graph distances linearly bounded w.r.t. Euclidean distances}} [[File:Yao graph.svg|thumb|right|200px]] ...2 KB (344 words) - 19:27, 18 February 2019
- {{Short description|Strongly regular graph}} {{Infobox graph ...2 KB (273 words) - 01:46, 24 July 2024
- {{Short description|Distance of a graph from a split graph}} ...with a [[clique (graph theory)|clique]] in blue and an [[independent set (graph theory)|independent set]] in red. ...3 KB (441 words) - 11:36, 4 February 2025
- ...matic Graph Theory |year=2009 |publisher=CRC Press |chapter=14. Colorings, Distance, and Domination |pages=397–438}}</ref> ...)-labeling number'', the smallest integer <math>n</math> such that a given graph has an L(2,1)-coloring using color numbers from 0 to <math>n</math>. The L( ...2 KB (271 words) - 00:40, 25 April 2024
- {{Short description|Graph whose embedding in a Euclidean space forms a regular tiling}} [[File:Square grid graph.svg|thumb|[[Square tiling|Square grid]] graph]] ...4 KB (652 words) - 00:31, 26 September 2024