Hamiltonian graph

reference

reference.

reference.

reference.

reference.

reference

reference G=⟨V,E⟩G=\langle V, E\rangle reference,reference VV reference V1V_1,reference p(G−V1)≤∣V1∣p(G-V_1) \leq |V_1|.reference p(x)p(x) reference xx reference.

reference:reference G=⟨V,E⟩G=\langle V, E\rangle reference,reference VV reference V1V_1,reference p(G−V1)≤∣V1∣+1p(G-V_1) \leq |V_1|+1.reference p(x)p(x) reference xx reference.

reference K2k+1(k≥1)K_{2k+1} (k \geq 1) reference kk reference,reference kk reference K2k+1K_{2k+1} reference.

reference K2k(k≥2)K_{2k} (k \geq 2) reference k−1k-1 reference,reference K2kK_{2k} reference k−1k-1 reference kk reference.

reference

reference GG reference n(n≥2)n(n \geq 2) reference,reference GG reference vi,vjv_i, v_j,reference d(vi)+d(vj)≥n−1d(v_i)+ d(v_j) \geq n - 1,reference GG reference.

reference 1:reference GG reference n(n≥3)n(n \geq 3) reference,reference GG reference vi,vjv_i, v_j,reference d(vi)+d(vj)≥nd(v_i)+ d(v_j) \geq n,reference GG reference,reference GG reference.

reference 2:reference GG reference n(n≥3)n(n \geq 3) reference,reference GG reference viv_i,reference d(vi)≥n2d(v_i) \geq \frac{n}{2},reference GG reference,reference GG reference.

reference DD reference n(n≥2)n(n \geq 2) reference,reference DD reference.

reference DD reference n(n≥2)n(n \geq 2) reference,reference DD reference.

reference.

reference DD reference n(n≥2)n(n \geq 2) reference,reference DD reference.

This content comes from OI Wiki: Hamiltonian graph. See the original for authors and revision history. AIOJ has adapted the formatting, in-site links, and resource paths.

Content is shared under CC BY-SA 4.0 and SATA license; additional terms are governed by the original notice. Thanks to the OI Wiki authors and contributors; per the SATA terms, please visit the OI Wiki repository and star it to show your support.