Codiameter: различия между версиями

'''Codiameter''' — ''[[кодиаметр]].''

Let <math>\,u,v \in V(G)</math> be any two distinct [[vertex|vertices]]. We denote by <math>\,p(u,v)</math> the length of the longest [[path]] connecting <math>\,u</math> and <math>\,v</math>. The '''codiameter''' of <math>\,G</math>, denoted by <math>\,d^{\ast}</math>, is defined to be

<math>\min\{p(u,v) | \; u,v \in V(G)\}</math>. A [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> of order <math>\,n</math> is said to be '''[[Hamiltonian connected graph|Hamilton-connected]]''' if <math>d^{\ast}(G) = n-1</math>, i.e. every two distinct vertices are joined by a ''[[Hamiltonian path]]''