Search results
Jump to navigation
Jump to search
- {{en-noun}} ...theory}} the number of vertices in a minimum [[dominating set]] of a given graph, often denoted as <math>\gamma=\gamma(G)</math> ...195 bytes (29 words) - 15:08, 7 November 2019
- * {{alter|en|semicomplete}} From {{prefix|en|semi|complete}}. ...746 bytes (111 words) - 01:11, 19 August 2024
- {{en-noun}} ...number of [[vertex|vertices]] in a maximum [[independent set]] of a given graph, often denoted as <math>\alpha = \alpha(G)</math>. ...389 bytes (57 words) - 21:20, 10 November 2024
- {{en-noun}} ...n|graph theory}} The number of vertices in a minimum [[vertex cover]] of a graph, often denoted as <math>\tau = \tau(G)</math>. ...227 bytes (34 words) - 18:35, 9 February 2017
- {{en-noun}} # {{lb|en|graph theory}} The number of edges in a minimum [[edge cover]] of a graph, often denoted as <math>\rho = \rho(G)</math>. ...217 bytes (33 words) - 15:53, 4 April 2017
- {{en-noun|-|head=[[Cayley]][[-'s|'s]] [[theorem]]}} ...ph theory}} A formula for the number of [[spanning trees]] of a [[complete graph]] of <math>n</math> vertices: <math>n^{n - 2}</math>. ...295 bytes (44 words) - 03:28, 4 February 2024
- {{blend|en|rectangle|graph}} {{en-noun}} ...636 bytes (91 words) - 07:04, 29 September 2019
- {{en-noun|~|head=[[algebraic]] [[graph theory]]}} ...ph theory]] in which [[algebraic]] methods are applied to problems about [[graph]]s. ...4 KB (609 words) - 04:04, 19 April 2024
- {{en-noun}} # {{lb|en|graph theory}} A [[regular]] graph of [[degree]] ''d'' and [[diameter]] ''k'' whose number of [[vertex|vertice ...411 bytes (59 words) - 05:45, 28 September 2024
- {{en-noun}} # {{lb|en|category theory}} a [[forgetful functor]] ...758 bytes (108 words) - 04:32, 4 January 2020
- {{en-noun|~}} ...) theorem concerning the existence of [[clique]]s in a labelled [[complete graph]]. ...1 KB (177 words) - 04:59, 28 September 2024
- From {{prefix|en|iso|radial}}. {{en-adj|-}} ...686 bytes (96 words) - 01:15, 19 August 2024
- {{en-noun}} # {{lb|en|graph theory|computer science}} A [[finite]] [[directed graph]] that contains no directed [[cycle]]s. ...3 KB (423 words) - 21:12, 1 March 2024
- {{en-noun|Laplacian matrices}} ...ry}} A square <math>n \times n</math> matrix which describes an undirected graph of <math>n</math> vertices by letting rows and columns correspond to vertic ...750 bytes (103 words) - 05:51, 28 September 2024
- [[File:Petersen graph 3-coloring.svg|right|thumb|A minimal colouring of a graph whose '''chromatic number''' is 3]] {{en-noun}} ...5 KB (746 words) - 14:01, 11 November 2024
- {{en-noun}} # {{lb|en|graph theory}} the number of edges in a maximum [[matching]], often denoted <math>\nu = ...203 bytes (29 words) - 14:12, 16 February 2017
- [[File:6n-graf.svg|right|thumb|A graph, such as is the subject of '''graph theory''']] {{en-noun|~}} ...7 KB (972 words) - 12:33, 19 November 2024
- From {{prefix|en|pseudo|achromatic}}. * {{audio|en|LL-Q1860 (eng)-Flame, not lame-pseudoachromatic.wav|a=US}} ...1 KB (202 words) - 16:03, 13 October 2024
- Anglicised from {{bor|en|de|Hoffmann}}, an occupational surname referring to the owner or manager of {{en-prop|~|s}} ...2 KB (281 words) - 10:54, 9 February 2025
- From {{prefix|en|anti|directed}}. {{en-adj|-}} ...686 bytes (97 words) - 01:52, 19 August 2024