‫ﺩﺭﺟﻪ ﺭﺍﺳﻬﺎ‪:‬‬

‫ﺍﮔﺮ ) ‪ v∈ V (G‬ﺑﺎﺷﺪ ﺩﺭﺟﻪ ﺭﺍﺱ ‪ v‬ﺭﺍ ﺑﻪ ﻃﻮﺭ ﺳﺎﺩﻩ ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎﻳﻲ ﺗﻌﺮﻳﻒ ﻣﻲ ﻛﻨﻴﻢ ﻛﻪ ‪ v‬ﺑﺮ ﺁﻧﻬﺎ ﻭﺍﻗـﻊ‬

‫ﺍﺳﺖ‪.‬‬

‫ﺗﺒﺼﺮﻩ‪ .‬ﺩﺭ ﮔﺮﺍﻑ ﻫﺎﻱ ﭼﻨﺪﮔﺎﻧﻪ ﻃﻮﻗﻪ ﺭﺍ ﺩﻭﺑﺎﺭ ﺩﺭ ﺩﺭﺟﻪ ﺭﺍﺱ ﻣﺮﺑﻮﻁ ﺑﻪ ﺣﺴﺎﺏ ﻣﻲ ﺁﻭﺭﻳﻢ‪.‬‬

‫) ‪. δ (G‬ﻛﻮﭼﻜﺘﺮﻳﻦ ﺩﺭﺟﻪ ﺩﺭ ﮔﺮﺍﻑ ‪ G‬ﺭﺍ ) ‪ δ (G‬ﺗﻌﺮﻳﻒ ﻣﻲ ﻛﻨﻴﻢ ) ﺑﺨﻮﺍﻧﻴﺪ ﺩﻟﺘﺎﻱ ﻛﻮﭼﻚ ‪( G‬‬ ‫•‬

‫) ‪ . ∆(G‬ﺑﺰﺭﮔﺘﺮﻳﻦ ﺩﺭﺟﻪ ﺩﺭ ﮔﺮﺍﻑ ‪ G‬ﺭﺍ ) ‪ ∆(G‬ﺗﻌﺮﻳﻒ ﻣﻲ ﻛﻨﻴﻢ ) ﺑﺨﻮﺍﻧﻴﺪ ﺩﻟﺘﺎﻱ ﺑﺰﺭﮒ ‪( G‬‬ ‫•‬

‫ﺩﺭﺟﻪ ﺭﺍﺱ ‪ v‬ﺭﺍ ﺑﺎ ) ‪ deg(v‬ﻳﺎ )‪ d (v‬ﻧﻤﺎﻳﺶ ﻣﻲ ﺩﻫﻴﻢ‪.‬‬

‫ﻗﻀﻴﻪ‪ .‬ﺩﺭ ﻫﺮ ﮔﺮﺍﻑ ‪ G‬ﺑﺎ ﻣﺠﻤﻮﻋﻪ ﺭﺋﻮﺱ )‪ (v‬ﻛﻪ ‪ G‬ﺳﺎﺩﻩ ﺑﺎﺷﺪ ﺩﺍﺭﻳﻢ‪:‬‬

‫‪∀v ∈V : 0 ≤ d (v ) < V‬‬

‫ﺍﺛﺒﺎﺕ‪ .‬ﺑﻪ ﺁﺳﺎﻧﻲ ﺛﺎﺑﺖ ﻣﻲ ﺷﻮﺩ‪ ،‬ﺯﻳﺮﺍ ﺣﺪﺍﻗﻞ ﺩﺭﺟﻪ ﻫﺮ ﺭﺍﺱ ﻣﻲ ﺗﻮﺍﻧﺪ ﺻﻔﺮ ﺑﺎﺷﺪ ﻳﻌﻨـﻲ ﺑـﻪ ﻫـﻴﭻ ﺭﺍﺱ‬

‫ﺩﻳﮕﺮﻱ ﻣﺘﺼﻞ ﻧﺒﺎﺷﺪ ﻭ ﺣﺪﺍﻛﺜﺮ ﺩﺭﺟﻪ ﻫﺮ ﺭﺍﺱ ﻫﻢ ﻣﻲ ﺗﻮﺍﻧﺪ ‪ V − 1‬ﺑﺎﺷﺪ ﻳﻌﻨﻲ ﺑﻪ ﻫﻤﻪ ﻣﺘﺼﻞ ﺑﺎﺷـﺪ ) ﺩﻗـﺖ‬

‫ﻛﻨﻴﺪ ﮔﺮﺍﻑ ﺳﺎﺩﻩ ﺑﻮﺩﻩ ﭘﺲ ﺑﻴﻦ ﻫﺮ ﺩﻭ ﺭﺍﺱ ﺣﺪﺍﻛﺜﺮ ﻳﻚ ﻳﺎﻝ ﻭﺟﻮﺩ ﺧﻮﺍﻫﺪ ﺩﺍﺷﺖ (‬

‫ﻟﺬﺍ ﺑﻪ ﺁﺳﺎﻧﻲ ﺩﻳﺪﻩ ﻣﻲ ﺷﻮﺩ‪:‬‬

‫‪0 ≤ δ (G ) ≤ d (V ) ≤ ∆G ≤ V − 1‬‬

‫) ‪δ (G ) = d (v) = ∆(G‬‬ ‫ﺗﻤﺮﻳﻦ‪ .‬ﮔﺮﺍﻓﻲ ﻣﺜﺎﻝ ﺑﺰﻧﻴﺪ ﻛﻪ ﺑﻪ ﺍﺯﺍﻱ ﻫﺮ ‪ v∈ V‬ﺩﺍﺷﺘﻪ ﺑﺎﺷﻴﻢ‪:‬‬

‫ﺑﻪ ﺭﺍﺣﺘﻲ ‪:‬‬

 ‫‪V1‬‬ ‫‪V2‬‬

‫‪∀v‬‬
‫‪i ∈V‬‬
‫) (‬
‫‪: δ (G ) = d Vi = ∆ (G ) = 2‬‬
‫‪V4‬‬ ‫‪V3‬‬

‫‪∑ d (V ) = 2 × E‬‬
‫) ‪v∈V (G‬‬
‫ﻗﻀﻴﻪ‪ .‬ﺩﺭ ﮔﺮﺍﻑ ﺳﺎﺩﻩ ‪ G‬ﺛﺎﺑﺖ ﻛﻨﻴﺪ‬

‫ﻳﻌﻨﻲ ﻣﺠﻤﻮﻉ ﺩﺭﺟﺎﺕ ﺑﺮﺍﺑﺮ ﺍﺳﺖ ﺑﺎ ﺩﻭ ﺑﺮﺍﺑﺮ ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎ‬

‫ﺍﺛﺒﺎﺕ‪ .‬ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎ ﺭﺍ ﺑﻪ ﺩﻭ ﮔﻮﻧﻪ ﻣﻲ ﺷﻤﺎﺭﻳﻢ‪ ،‬ﻳﻜﻲ ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎ ﻳﻌﻨﻲ ‪ E‬ﺑﻮﺩﻩ ﻭ ﺩﻭﻣﻲ ﺍﻳﻨﻜﻪ ﻫـﺮ ﻳـﺎﻟﻲ‬

‫ﺍﺑﺘﺪﺍ ﻭ ﺍﻧﺘﻬﺎ ﺩﺍﺭﺩ ﻛﻪ ﺑﻪ ﺍﺯﺍﻱ ﻫﺮ ﺳﺮ ﺁﻥ ﺩﺭﺟﻪ ﻳﻚ ﺭﺍﺱ ﺭﺍ ﻳﻚ ﻭﺍﺣﺪ ﺍﻓﺰﺍﻳﺶ ﺩﺍﺩﻩ‪ ،‬ﭘـﺲ ﺍﮔـﺮ ﻣﺠﻤـﻮﻉ ﺗﻤـﺎﻡ‬

‫ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ ﺭﺍ ﺣﺴﺎﺏ ﻛﻨﻴﻢ ﻫﺮﻳﺎﻝ ﺩﻗﻴﻘﺎﹰ ﺩﻭ ﺑﺎﺭ ﺷﻤﺮﺩﻩ ﻣﻲ ﺷﻮﺩ ﻭ ﺍﻳﻦ ﻳﻌﻨﻲ ﺩﻭ ﺑﺮﺍﺑﺮ ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎ ﻣﻲ ﮔـﺮﺩﺩ‪.‬‬

‫ﭘﺲ‬

‫‪∑ d (V ) = 2 × E‬‬
‫) ‪v∈V (G‬‬

‫ﻧﺘﻴﺠﻪ‪ .‬ﻣﺠﻤﻮﻉ ﺩﺭﺟﺎﺕ ﻫﺮ ﮔﺮﺍﻑ ‪ G‬ﺯﻭﺝ ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

‫ﺑﻪ ﻭﺿﻮﺡ ﺍﺯ ﻗﻀﻴﻪ ﻗﺒﻞ ﻧﺘﻴﺠﻪ ﻣﻲ ﮔﺮﺩﺩ‪.‬‬

‫ﻗﻀﻴﻪ‪ .‬ﺗﻌﺪﺍﺩ ﺭﺋﻮﺱ ﺩﺭﺟﻪ ﻓﺮﺩ ﮔﺮﺍﻑ ‪ ، G‬ﺯﻭﺝ ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

‫ﺑﺮﻫﺎﻥ ﺧﻠﻒ‪ .‬ﺍﮔﺮ ﺗﻌﺪﺍﺩ ﺭﺋﻮﺱ ﺩﺭﺟﻪ ﻓﺮﺩ ﮔﺮﺍﻑ ‪ G‬ﻓﺮﺩ ﺑﺎﺷﺪ‪،‬ﺁﻧﮕﺎﻩ ﻣﺠﻤﻮﻉ ﺩﺭﺟﺎﺕ ﺁﻧﻬﺎ ﻋﺪﺩﻱ ﻓﺮﺩ ﻣﻲ‬

‫ﺷﻮﺩ ﻛﻪ ﺑﺎ ﺍﻓﺰﻭﺩﻥ ﺳﺎﻳﺮ ﺩﺭﺟﻪ ﻫﺎﻱ ﺯﻭﺝ ﺑﻪ ﻋﺪﺩ ﻓﺮﺩ ﺑﺎﺯ ﻫﻢ ﻣﺠﻤﻮﻉ ﺩﺭﺟﺎﺕ ﻓﺮﺩ ﺑﺎﻗﻲ ﻣﻲ ﻣﺎﻧﺪ ﭘﺲ ﻣﺠﻤﻮﻉ ﻛﻞ‬
 ‫ﺩﺭﺟﺎﺕ ﮔﺮﺍﻑ ﻓﺮﺩ ﻣﻲ ﺷﻮﺩ ﻛﻪ ﻣﺨﺎﻟﻒ ﺑﺎ ﻧﺘﻴﺠﻪ ﻗﺒﻞ ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

‫ﺗﻌﺮﻳﻒ‪ .‬ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ‪.‬‬

‫ﺑﻪ ﺩﻧﺒﺎﻟﻪ ﺍﻱ ﻛﻪ ﺍﺯ ﭘﺸﺖ ﺳﺮ ﻫﻢ ﻗﺮﺍﺭ ﺩﺍﺩﻥ ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ ﮔﺮﺍﻑ ‪ G‬ﺑﺪﺳﺖ ﻣﻲ ﺁﻳﺪ‪.‬‬

‫ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ ﮔﺮﺍﻑ ‪ G‬ﻣﻲ ﮔﻮﻳﻨﺪ‪.‬‬

‫)‪ 2‬ﻭ ‪ 2‬ﻭ ‪ 3‬ﻭ ‪ 2‬ﻭ ‪(1‬‬ ‫ﻣﺜﺎﻝ‪.‬‬

‫ﺿﻤﻨﺎﹰ ﻏﺎﻟﺒﺎﹰ ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ ﺭﺍ ﺑﻪ ﺗﺮﺗﻴﺐ ﺻﻌﻮﺩﻱ ﻣﺮﺗﺐ ﻣﻲ ﻛﻨﻨﺪ‪.‬‬

‫ﺗﻌﺮﻳﻒ‪ .‬ﺩﻧﺒﺎﻟﻪ ﮔﺮﺍﻓﻴﻜﻲ‪ .‬ﺑﻪ ﻫﺮ ﺩﻧﺒﺎﻟﻪ ﺍﺯ ﺍﻋﺪﺍﺩ ﻃﺒﻴﻌﻲ ﻣﺎﻧﻨﺪ ) ‪ (a1 , a 2 ,..., a n‬ﻛﻪ ﮔﺮﺍﻓﻲ ﻭﺟـﻮﺩ ﺩﺍﺷـﺘﻪ‬

‫ﺑﺎﺷﺪ ﻛﻪ ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ ﺁﻥ ﺑﺮﺍﺑﺮ ﺑﺎ ﺍﻳﻦ ﺩﻧﺒﺎﻟﻪ ﺷﻮﺩ ﺩﻧﺒﺎﻟﻪ ﮔﺮﺍﻓﻴﻜﻲ ﮔﻮﻳﻨﺪ ﻣﺎﻧﻨﺪ ) ‪2‬ﻭ‪2‬ﻭ‪3‬ﻭ ‪2‬ﻭ‪ ( 1‬ﻛﻪ ﺩﺭ‬

‫ﺗﻤﺮﻳﻦ ﻗﺒﻞ ﺩﻳﺪﻳﻢ ﮔﺮﺍﻓﻲ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﻛﻪ ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﺎﺕ ﺭﺋﻮﺱ ﺁﻥ ﺑﺮﺍﺑﺮ ﺑﺎ ﺍﻳﻦ ﺩﻧﺒﺎﻟﻪ ﺷﻮﺩ‪.‬‬

‫ﺣﺎﻝ ﺳﻮﺍﻟﻲ ﻛﻪ ﺍﻳﻨﺠﺎ ﻣﻄﺮﺡ ﻣﻲ ﺷﻮﺩ ﺍﻳﻦ ﺍﺳﺖ ﻛﻪ ﺁﻳﺎ ﻫﺮ ﺩﻧﺒﺎﻟﻪ ﺍﻋﺪﺍﺩﻱ ﻳﻚ ﺩﻧﺒﺎﻟﻪ ﮔﺮﺍﻓﻴﻜﻲ ﺍﺳﺖ؟‬

‫ﻭﺍﺿﺢ ﺍﺳﺖ ﻛﻪ ﺧﻴﺮ‪ -‬ﭘﺲ ﭼﻪ ﺩﻧﺒﺎﻟﻪ ﺍﻋﺪﺍﺩﻱ ﺩﻧﺒﺎﻟﻪ ﮔﺮﺍﻓﻴﻜﻲ ﺧﻮﺍﻫﻨﺪ ﺑﻮﺩ؟‬

‫ﻧﺨﺴﺖ ﺷﺮﻭﻁ ﻻﺯﻡ ﺑﺮﺍﻱ ﮔﺮﺍﻓﻴﻜﻲ ﺑﻮﺩﻥ ﺩﻧﺒﺎﻟﻪ ﺭﺍ ﺑﺮﺭﺳﻲ ﻣﻲ ﻛﻨﻴﻢ‪.‬‬

‫‪ .1‬ﺩﺭ ﺩﻧﺒﺎﻟﻪ ﺩﺍﺩﻩ ﺷﺪﻩ ‪. 0 ≤ δ (G ) ≤ ∆(G ) < V‬‬

‫ﺗﻤﺮﻳﻦ‪ .‬ﺁﻳﺎ ﺩﻧﺒﺎﻟﻪ ) ‪4‬ﻭ‪2‬ﻭ‪1‬ﻭ‪ ( 1‬ﺩﻧﺒﺎﻟﻪ ﮔﺮﺍﻓﻴﻜﻲ ﺍﺳﺖ‪.‬‬

‫ﺟﻮﺍﺏ‪ .‬ﺧﻴﺮ ﺯﻳﺮﺍ ﺍﺯ ﺗﻌﺪﺍﺩ ﺍﻋﺪﺍﺩ ﻣﻌﻠﻮﻡ ﺍﺳﺖ ﻛﻪ ﮔﺮﺍﻑ ﺑﺎﻳﺪ ‪ 4‬ﺭﺍﺱ ﺩﺍﺷـﺘﻪ ﺑﺎﺷـﺪ ﻭﻟـﻲ ﭼـﻮﻥ‬

‫ﺑﺰﺭﮔﺘﺮﻳﻦ ﺩﺭﺟﻪ ﺁﻥ ‪ 4‬ﺑﻮﺩﻩ ﻭ ﻛﻮﭼﻜﺘﺮ ﺍﺯ ﺗﻌﺪﺍﺩ ﺭﺋﻮﺱ ﻧﻴﺴﺖ ﺍﻳﻦ ﺩﻧﺒﺎﻟﻪ ﮔﺮﺍﻓﻴﻜﻲ ﻧﻴﺴﺖ‪.‬‬

‫‪ .2‬ﺗﻌﺪﺍﺩ ﺩﺭﺟﺎﺕ ﻓﺮﺩ‪ ،‬ﺯﻭﺝ ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

 ‫ﺗﻤﺮﻳﻦ‪ .‬ﺁﻳﺎ ﺩﻧﺒﺎﻟﻪ ) ‪4‬ﻭ‪3‬ﻭ‪3‬ﻭ‪2‬ﻭ‪1‬ﻭ‪1‬ﻭ‪ (1‬ﻣﻲ ﺗﻮﺍﻧﺪ ﮔﺮﺍﻓﻴﻜﻲ ﺑﺎﺷﺪ؟‬

‫ﺟﻮﺍﺏ‪ .‬ﺧﻴﺮ‪.‬‬

‫ﺗﻤﺮﻳﻦ‪ .‬ﺁﻳﺎ ﮔﺮﺍﻓﻲ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﻛﻪ ﻻﺍﻗﻞ ﺩﻭ ﺭﺍﺱ ﺁﻥ ﺩﺭﺟﻪ ‪ V − 1‬ﺑﺎﺷﺪ‬

‫ﺟﻮﺍﺏ‪ .‬ﺑﻪ ﺳﺎﺩﮔﻲ ﺑﻠﻲ‪ ،‬ﺩﺭ ﮔﺮﺍﻑ ﻛﺎﻣﻞ ‪ Kn‬ﺩﺭﺟﻪ ﺗﻤﺎﻡ ﺭﺋﻮﺱ ‪ V − 1‬ﻣﻲ ﺑﺎﺷﺪ‪.‬‬

‫ﻣﺜﺎﻝ‪ .‬ﻳﻚ ﺷﺮﻁ ﺑﺎﺯﮔﺸﺘﻲ‪ .‬ﻓﻬﺮﺳﺖ ‪ 0،0،2‬ﮔﺮﺍﻓﻴﻜﻲ ﻧﻴﺴﺖ‪ ،‬ﺍﻣﺎ ‪ 1،1،2،2‬ﮔﺮﺍﻓﻴﻜﻲ ﺍﺳﺖ‪ ،‬ﻫﻤـﻴﻦ ﻃـﻮﺭ‬

‫‪ 1،0،1 ، k 2 + k1‬ﺭﺍ ﻣﺤﻘﻖ ﻣﻲ ﺳﺎﺯﺩ؛ ﺍﮔﺮ ﺭﺍﺱ ﺟﺪﻳﺪﻱ ﺭﺍ ﻣﺠﺎﻭﺭ ﺑﺎ ﺭﺍﺱ ﺗﻨﻬﺎ ﻭ ﻳﻚ ﺭﺍﺱ ﺩﺭﺟﻪ‬ ‫‪ 1،0،1‬ﮔﺮﺍﻑ‬

‫‪ 1‬ﺍﺿﺎﻓﻪ ﻛﻨﻴﻢ‪ ،‬ﺁﻧﮕﺎﻩ ﻳﻚ ﮔﺮﺍﻑ ﺑﺎ ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﻪ ﻫﺎﻱ ‪ 1،1،2،2‬ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻭﺭﻳﻢ ) ﺗﺼﻮﻳﺮ ﺯﻳﺮ(‪ .‬ﺑﺮﻋﻜﺲ‪ ،‬ﺍﮔـﺮ‬

‫ﻳﻚ ﮔﺮﺍﻑ ﺩﺍﺷﺘﻪ ﺑﺎﺷﻴﻢ ‪ 1،1،2،2‬ﺭﺍ ﻣﺤﻘﻖ ﺳﺎﺯﺩ ﻭ ﺩﺭ ﺁﻥ ﺭﺍﺳﻲ ﻣﺎﻧﻨﺪ ‪ w‬ﺍﺯ ﺩﺭﺟﻪ ﻣﺎﻛﺴﻴﻤﻢ ﻣﺠﺎﻭﺭ ﺑﺎ ﺭﺍﺳﻬﺎﻱ‬

‫ﺍﺯ ﺩﺭﺟﻪ ‪ 2‬ﻭ ‪ 1‬ﺑﺎﺷﺪ‪،‬ﺁﻧﮕﺎﻩ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ‪ w‬ﺭﺍ ﺑﺮﺍﻱ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﺩﻥ ﻳﻚ ﮔﺮﺍﻑ ﺑﺎ ﻓﻬﺮﺳـﺖ ﺩﺭﺟـﻪ ﻫـﺎﻱ ‪1،0،1‬‬

‫ﺣﺬﻑ ﻛﻨﻴﻢ‪.‬‬

‫‪w‬‬

‫ﺍﻳﻦ ﻣﻼﺣﻈﺎﺕ ﻳﻚ ﺁﺯﻣﻮﻥ ﺑﺎﺯﮔﺸﺘﻲ ﺭﺍ ﺑﺮﺍﻱ ﺩﻧﺒﺎﻟﻪ ﻫﺎﻱ ﮔﺮﺍﻓﻴﻜﻲ ﺍﺭﺍﺋﻪ ﻣﻲ ﺩﻫﺪ‪ .‬ﺑـﺮﺍﻱ ﺁﺯﻣـﻮﻥ ﺩﻧﺒﺎﻟـﻪ‬

‫‪ ، 33333221‬ﻣﻲ ﺗﻮﺍﻧﻴﻢ ﺗﺤﻘﻖ ﺳﺎﺯﻱ ﺭﺍ ﺑﺎ ﺭﺍﺳﻲ ﻣﺎﻧﻨﺪ ‪ y‬ﺍﺯ ﺩﺭﺟﻪ ‪ 3‬ﺟﺴﺘﺠﻮ ﻛﻨﻴﻢ ﻛﻪ ﺩﺍﺭﺍﻱ ﺳﻪ ﻫﻤﺴﺎﻳﻪ ﺍﺯ‬

‫ﺩﺭﺟﻪ ‪ 3‬ﺑﺎﺷﺪ‪ .‬ﭼﻨﻴﻦ ﮔﺮﺍﻓﻲ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﺍﮔﺮ‪ ،‬ﻭ ﻓﻘﻂ ﺍﮔﺮ‪ 2223221 ،‬ﮔﺮﺍﻓﻴﻜﻲ ﺑﺎﺷﺪ ) ﺑﻪ ﻭﺳﻴﻠﻪ ﺣﺬﻑ ‪ .( y‬ﺍﻳﻦ‬
‫ﺭﺍ ﺩﻭﺑﺎﺭﻩ ﺑﻪ ﺻﻮﺭﺕ ‪ 3222221‬ﻣﺮﺗﺐ ﻣﻲ ﻛﻨﻴﻢ ﻭ ﺗﺤﻘﻖ ﺳﺎﺯﻱ ﺭﺍ ﺑﺎ ﺭﺍﺳﻲ ﻣﺎﻧﻨﺪ ‪ x‬ﺍﺯ ﺩﺭﺟـﻪ ‪ 3‬ﺟـﺴﺘﺠﻮ ﻣـﻲ‬

‫ﻛﻨﻴﻢ ﻛﻪ ﺩﺍﺭﺍﻱ ﺳﻪ ﻫﻤﺴﺎﻳﻪ ﺍﺯ ﺩﺭﺟﻪ ‪ 2‬ﺑﺎﺷﺪ‪ .‬ﭼﻨﻴﻦ ﮔﺮﺍﻓﻲ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﺍﮔﺮ‪ 111221 ،‬ﻣﺮﺗﺐ ﻣﻲ ﻛﻨﻴﻢ ﻭ ﺗﺤﻘـﻖ‬

‫ﺳﺎﺯﻱ ﺭﺍ ﺑﺎ ﺭﺍﺳﻲ ﻣﺎﻧﻨﺪ ‪ x‬ﺍﺯ ﺩﺭﺟﻪ ‪ 3‬ﺟﺴﺘﺠﻮ ﻣﻲ ﻛﻨﻴﻢ ﻛﻪ ﺩﺍﺭﺍﻱ ﺳﻪ ﻫﻤﺴﺎﻳﻪ ﺍﺯ ﺩﺭﺟﻪ ‪ 2‬ﺑﺎﺷﺪ‪ .‬ﭼﻨﻴﻦ ﮔﺮﺍﻓﻲ‬

‫ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﺍﮔﺮ‪ ،‬ﻭ ﻓﻘﻂ ﺍﮔﺮ‪ 111221 ،‬ﮔﺮﺍﻓﻴﻜﻲ ﺑﺎﺷﺪ) ﺑﻪ ﻭﺳﻴﻠﻪ ﺣﺬﻑ ‪ .( x‬ﺍﻳﻦ ﺭﺍ ﺩﻭﺑﺎﺭﻩ ﺑﻪ ﺻـﻮﺭﺕ ‪221111‬‬

‫ﻣﺮﺗﺐ ﻣﻲ ﻛﻨﻴﻢ ﻭ ﺗﺤﻘﻖ ﺳﺎﺯﻱ ﺭﺍ ﺑﺎ ﺭﺍﺳﻲ ﻣﺎﻧﻨﺪ ‪ w‬ﺍﺯ ﺩﺭﺟﻪ ‪ 2‬ﺑﺎ ﻫﻤﺴﺎﻳﻪ ﻫﺎﻱ ﺩﺭﺟﻪ ‪ 2‬ﻭ ‪ 1‬ﺟﺴﺘﺠﻮ ﻣﻲ ﻛﻨـﻴﻢ‪.‬‬

‫ﭼﻨﻴﻦ ﮔﺮﺍﻓﻲ ﻭﺟﻮﺩ ﺩﺍﺭﺩ ﺍﮔﺮ ﻭ ﻓﻘﻂ ﺍﮔﺮ‪ 10111 ،‬ﮔﺮﺍﻓﻴﻜﻲ ﺑﺎﺷﺪ‪ .‬ﺷﺎﻳﺪ ﺑﺘـﻮﺍﻥ ﺗـﺸﺨﻴﺺ ﺩﺍﺩ ﻛـﻪ ﺍﻳـﻦ ﻭﺍﻗﻌـﺎﹰ‬

‫ﮔﺮﺍﻓﻴﻜﻲ ﺍﺳﺖ‪ .‬ﺑﺎ ﺁﻏﺎﺯ ﻳﻚ ﺗﺤﻘﻖ ﺳﺎﺯﻱ ﺍﺯ ‪،10111‬ﻣﻲ ﺗﻮﺍﻧﻴﻢ ‪ y, x, w‬ﺭﺍ ﺑﺎ ﻭﻳﮋﮔﻴﻬﺎﻱ ﻣﻄﻠﻮﺏ ﺑﺮﺍﻱ ﺑﻪ ﺩﺳﺖ‬

‫ﺁﻭﺭﺩﻥ ﻳﻚ ﺗﺤﻘﻖ ﺳﺎﺯﻱ ﺍﺯ ﺩﻧﺒﺎﻟﻪ ﺍﻭﻟﻴﻪ ‪ 33333221‬ﺟﺎﻳﮕﺰﻳﻦ ﻛﻨﻴﻢ‪ .‬ﺗﺤﻘﻖ ﺳﺎﺯﻱ ﻳﻜﺘﺎ ﻧﻴﺴﺖ‪.‬‬

‫‪w‬‬

‫‪x‬‬ ‫‪y‬‬

‫ﻗﻀﻴﻪ‪ ) .‬ﻫﺎﻭﻝ ]‪ ، [1955‬ﺣﻜﻴﻤﻲ ]‪ ( [1962‬ﺑﺮﺍﻱ ‪ ، n > 1‬ﻓﻬﺮﺳﺖ ﺍﻋﺪﺍﺩ ﺻﺤﻴﺢ ﻧـﺎﻣﻨﻔﻲ ‪ d‬ﺑـﺎ ﺍﻧـﺪﺍﺯﻩ‬

‫‪ n‬ﮔﺮﺍﻓﻴﻜﻲ ﺍﺳﺖ ﺍﮔﺮ‪ ،‬ﻭ ﻓﻘﻂ ﺍﮔﺮ‪ d ′ ،‬ﮔﺮﺍﻓﻴﻜﻲ ﺑﺎﺷﺪ‪ ،‬ﺩﺭ ﺣﺎﻟﻲ ﻛﻪ ‪ d ′‬ﻓﻬﺮﺳﺘﻲ ﺑﺎ ﺍﻧﺪﺍﺯﻩ ‪ n − 1‬ﺍﺳﺖ ﻛﻪ ﺍﺯ ‪d‬‬

‫ﺑﺎ ﺣﺬﻑ ﺑﺰﺭﮔﺘﺮﻳﻦ ﻋﻨﺼﺮ ﺁﻥ ∆ ﻭ ﻛﻢ ﻛﺮﺩﻥ ‪ 1‬ﺍﺯ ∆ ﺑﺰﺭﮔﺘﺮﻳﻦ ﻋﻨﺎﺻﺮ ﺑﻌﺪﻱ ﺑﻪ ﺩﺳﺖ ﺁﻣﺪﻩ ﺍﺳﺖ‪ .‬ﺗﻨﻬﺎ ﺩﻧﺒﺎﻟـﻪ‬

‫ﮔﺮﺍﻓﻴﻜﻲ ‪ -1‬ﻋﻨﺼﺮﻱ‪ d1 = 0 ،‬ﺍﺳﺖ‪.‬‬

‫ﺍﺛﺒﺎﺕ‪ .‬ﺑﺮﺍﻱ ‪ ، n = 1‬ﮔﺰﺍﺭﻩ ﺑﺪﻳﻬﻲ ﺍﺳﺖ‪ .‬ﺑﺮﺍﻱ ‪ ، n > 1‬ﻧﺨﺴﺖ ﺛﺎﺑﺖ ﻣﻲ ﻛﻨﻴﻢ ﻛﻪ ﺷﺮﻁ ﻛﺎﻓﻲ ﺍﺳﺖ‪ .‬ﺑﺎ ﺩﺭ‬

‫ﻧﻈﺮ ﮔﺮﻓﺘﻦ ‪ d‬ﺑﺎ ﻗﻴﺪ ‪ ، d1 ≥ ... ≥ d n‬ﻭ ﻫﻤﭽﻨﻴﻦ ﺑﺎ ﺩﺭ ﻧﻈﺮ ﮔﺮﻓﺘﻦ ﻳﻚ ﮔﺮﺍﻑ ﺳﺎﺩﻩ ‪ G ′‬ﺑﺎ ﺩﻧﺒﺎﻟﻪ ﺩﺭﺟﻪ ﻫـﺎﻱ‬

‫‪ ، d ′‬ﻳﻚ ﺭﺍﺱ ﺟﺪﻳﺪﻱ ﻣﺠﺎﻭﺭ ﺑﺎ ﺭﺍﺳﻬﺎﻱ ‪ G ′‬ﻛﻪ ﺩﺍﺭﺍﻱ ﺩﺭﺟﻪ ﻫﺎﻱ ‪ d ∆ +1 − 1,..., d2 − 1‬ﺍﺳﺖ ﻣﻲ ﺍﻓﺰﺍﻳﻴﻢ‪ .‬ﺍﻳﻦ‬

‫‪ di‬ﻫﺎ ﻋﺒﺎﺭﺗﻨﺪ ﺍﺯ ﺑﺰﺭﮔﺘﺮﻳﻦ ﻋﻨﺎﺻﺮ ﺑﻌﺪ ﺍﺯ ) ﻧﺴﺨﻪ ﺍﻱ ﺍﺯ ( ∆ ﻭ ﺧﻮﺩ‪ ،‬ﺍﻣﺎ ﺍﻋﺪﺍﺩ ‪ d ∆ +1 − 1,..., d2 − 1‬ﻟﺰﻭﻣﻲ‬

‫ﻧﺪﺍﺭﺩ ﻛﻪ ﺑﺰﺭﮔﺘﺮﻳﻦ ﺍﻋﺪﺍﺩ ﺍﺯ ∆ ﺩﺭ ‪ d ′‬ﺑﺎﺷﻨﺪ‪.‬‬

‫ﺑﺮﺍﻱ ﺍﺛﺒﺎﺕ ﻟﺰﻭﻡ ﺷﺮﻁ‪ ،‬ﺑﺎ ﻳﻚ ﮔﺮﺍﻑ ﺳﺎﺩﻩ ‪ G‬ﻛﻪ ‪ d‬ﺭﺍ ﻣﺤﻘﻖ ﻣﻲ ﺳﺎﺯﺩ ﺁﻏﺎﺯ ﻣﻲ ﻛﻨﻴﻢ ﻭ ﻳـﻚ ﮔـﺮﺍﻑ‬

‫ﺳﺎﺩﻩ ‪ G ′‬ﺭﺍ ﺍﻳﺠﺎﺩ ﻣﻲ ﻛﻨﻴﻢ ﻛﻪ ‪ d ′‬ﺭﺍ ﻣﺤﻘﻖ ﻛﻨﺪ‪ .‬ﻓﺮﺽ ﻛﻨﻴﻢ ‪ w‬ﺭﺍﺳﻲ ﺍﺯ ﺩﺭﺟـﻪ ∆ ﺩﺭ ‪ G‬ﺑﺎﺷـﺪ‪ .‬ﻓـﺮﺽ‬

‫ﻛﻨﻴﻢ ‪ S‬ﻳﻚ ﻣﺠﻤﻮﻋﻪ ﺍﺯ ∆ ﺭﺍﺳﻬﺎﻱ ﺩﺭ ‪ G‬ﺑﺎﺷﺪ ﻛﻪ ﺩﺭﺍﻱ )) ﺩﺭﺟﻪ ﻫﺎﻱ ﻣﻄﻠﻮﺏ (( ‪ d ∆ +1 ,..., d 2‬ﺍﺳﺖ‪ .‬ﺍﮔـﺮ‬

‫‪ ، N ( w) = S‬ﺁﻧﮕﺎﻩ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ﺑﺎ ﺣﺬﻑ ‪ G ′,w‬ﺭﺍ ﺑﻪ ﺩﺳﺖ ﺁﻭﺭﻳﻢ‪ .‬ﺩﺭ ﻏﻴﺮ ﺍﻳﻦ ﺻﻮﺭﺕ‪ ،‬ﺭﺍﺳﻲ ﺍﺯ ‪ S‬ﻭﺟﻮﺩ ﺩﺍﺭﺩ‬

‫ﻛﻪ ﺍﺯ )‪ N (w‬ﺣﺬﻑ ﺷﺪﻩ ﺍﺳﺖ‪ .‬ﺩﺭ ﺍﻳﻦ ﺣﺎﻟﺖ‪ G ،‬ﺭﺍ ﺑﺮﺍﻱ ﺍﻓﺰﺍﻳﺶ ‪ N ( w) ∩ S‬ﺑﺪﻭﻥ ﺗﻐﻴﻴﺮ ﺩﺭﺟﻪ ﻫﻴﭻ ﺭﺍﺳﻲ‬

‫ﺗﻌﺪﻳﻞ ﻣﻲ ﻛﻨﻴﻢ‪ .‬ﭼﻮﻥ ‪ N ( w) ∩ S‬ﺣﺪﺍﻛﺜﺮ ∆ ﺑﺎﺭ ﻣﻲ ﺗﻮﺍﻧﺪ ﺍﻓﺰﺍﻳﺶ ﻳﺎﺑﺪ‪ ،‬ﺗﻜﺮﺍﺭ ﺍﻳﻦ ﺷﻴﻮﻩ ﻳﻚ ﮔﺮﺍﻑ ﺩﻟﺨﻮﺍﻩ‬

‫‪ G‬ﻛﻪ ‪ d‬ﺭﺍ ﻣﺤﻘﻖ ﻣﻲ ﺳﺎﺯﺩ ﺑﻪ ﻳﻚ ﮔـﺮﺍﻑ * ‪ G‬ﺗﺒـﺪﻳﻞ ﻣـﻲ ﻛﻨـﺪ ﻛـﻪ ‪ d‬ﺭﺍ ﻣﺤﻘـﻖ ﻣـﻲ ﻧﻤﺎﻳـﺪ ﻭ ﺩﺍﺭﺍﻱ‬

‫‪ N ( w) = S‬ﺍﺳﺖ‪ .‬ﺣﺎﻝ ﺍﺯ * ‪ G‬ﻣﻲ ﺗﻮﺍﻧﻴﻢ ‪ w‬ﺭﺍ ﺣﺬﻑ ﻛﻨﻴﻢ ﺗﺎ ﮔﺮﺍﻑ ﻣﻄﻠﻮﺏ ‪ G′‬ﺭﺍ ﻛﻪ ‪ d ′‬ﺭﺍ ﻣﺤﻘﻖ ﻣـﻲ‬

‫ﻛﻨﺪ ﺑﻪ ﺩﺳﺖ ﻣﻲ ﺁﻭﺭﻳﻢ‪.‬‬

‫ﺍﮔﺮ ‪ ، N ( w) ≠ S‬ﺁﻧﮕﺎﻩ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ‪ z ∉ S, x ∈ S‬ﺭﺍ ﻃﻮﺭﻱ ﺍﻧﺘﺨﺎﺏ ﻛﻨﻴﻢ ﻛﻪ ‪ ،w ↔ x , w ↔ z‬ﺯﻳﺮﺍ‬

‫‪ . d ( w) = ∆ = S‬ﺑﻨﺎﺑﺮ ﺍﻧﺘﺨﺎﺏ ‪ ، S‬ﺩﺍﺭﻳﻢ )‪ . d ( w) ≥ d ( z‬ﻣﻲ ﺧﻮﺍﻫﻴﻢ ‪ wx‬ﺭﺍ ﺍﺿﺎﻓﻪ ﻭ ‪ wz‬ﺭﺍ ﺣﺬﻑ ﻛﻨﻴﻢ‪ ،‬ﺍﻣـﺎ‬

‫ﻧﺒﺎﻳﺪ ﺩﺭﺟﻪ ﻫﺎﻱ ﺭﺍﺳﻬﺎ ﺭﺍ ﺗﻐﻴﻴﺮ ﺩﻫﻴﻢ‪ ،‬ﺑﻨﺎﺑﺮﺍﻳﻦ ﺑﺎﻳﺪ ﺩﺭﺟﻪ ﻫﺎﻱ ‪ z, x‬ﺭﺍ ﺩﻭﺑﺎﺭﻩ ﺑﺮ ﻗﺮﺍﺭ ﻛﻨﻴﻢ‪ .‬ﻛﺎﻓﻲ ﺍﺳﺖ ﺭﺍﺳﻲ‬
 ‫ﻣﺎﻧﻨﺪ ‪ y‬ﺭﺍ ﺑﻴﺮﻭﻥ }‪ T {x, y, z‬ﻃﻮﺭﻱ ﭘﻴﺪﺍ ﻛﻨﻴﻢ ﻛﻪ ‪/ z , y ↔ x‬‬
‫↔ ‪ y‬؛ ﺍﮔﺮ ﭼﻨﻴﻦ ‪ y‬ﺍﻱ ﻭﺟﻮﺩ ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪،‬‬

‫ﺁﻧﮕﺎﻩ ﻫﻤﭽﻨﻴﻦ ﻣﻲ ﺗﻮﺍﻧﻴﻢ ‪ xy‬ﺭﺍ ﺣﺬﻑ ﻭ ‪ zy‬ﺭﺍ ﺍﺿﺎﻓﻪ ﻛﻨﻴﻢ ) ﺗﺼﻮﻳﺮ ﺭﺍ ﺑﺒﻴﻨﺪ (‪ .‬ﻓﺮﺽ ﻛﻨﻴﻢ ‪ ε‬ﺗﻌـﺪﺍﺩ ﻧـﺴﺨﻪ‬

‫ﻫﺎﻱ ﻳﺎﻝ ‪ 0 ) xz‬ﻳﺎ ‪ ( 1‬ﺑﺎﺷﺪ‪ .‬ﺣﺎﻝ ‪ x‬ﺩﺍﺭﺍﻱ ‪ d (x) − ε‬ﻫﻤﺴﺎﻳﻪ ﺑﻴـﺮﻭﻥ ‪ T‬ﺍﺳـﺖ‪ ،‬ﻭ ‪ z‬ﺩﺍﺭﺍﻱ ‪d (z) −1 − ε‬‬

‫ﻫﻤﺴﺎﻳﻪ ﺑﻴﺮﻭﻥ ‪ T‬ﻣﻲ ﺑﺎﺷﺪ‪ .‬ﭼﻮﻥ )‪ y, d ( x) ≥ d ( z‬ﻣﻄﻠﻮﺏ ﺑﻴﺮﻭﻥ ‪ T‬ﻭﺟﻮﺩ ﺩﺍﺭﺩ‪ ،‬ﻭ ﻣـﻲ ﺗـﻮﺍﻧﻴﻢ ﺟﺎﺑﺠـﺎﻳﻲ‬

‫ﻣﻮﺭﺩ ﻧﻈﺮ ﺭﺍ ﺍﻧﺠﺎﻡ ﻣﻲ ﺩﻫﻴﻢ‪.‬‬

‫‪s‬‬
‫‪x‬‬
‫‪w‬‬ ‫‪y‬‬

‫‪z‬‬

‫ﻗﻀﻴﻪ ﻓﻮﻕ ﻓﻬﺮﺳﺘﻲ ﺍﺯ ‪ n‬ﻋﺪﺩ ﺭﺍ ﺑﺎ ﺁﺯﻣﻮﺩﻥ ﻓﻬﺮﺳﺘﻲ ﺍﺯ ‪ n − 1‬ﻋﺪﺩ ﺁﺯﻣﻮﻥ ﻣﻲ ﻛﻨﺪ؛ ﺍﺯ ﺍﻳﻦ ﺭﻭ ﻣﻲ ﺗﻮﺍﻥ‬

‫ﺁﻥ ﺭﺍ ﺑﻪ ﻋﻨﻮﺍﻥ ﻳﻚ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺗﻜﺮﺍﺭﻱ ﺑﺮﺍﻱ ﺁﺯﻣـﻮﻥ ﺍﻳﻨﻜـﻪ ﺁﻳـﺎ ‪ d‬ﮔﺮﺍﻓﻴﻜـﻲ ﺍﺳـﺖ ﺍﻧﺠـﺎﻡ ﺩﺍﺩ‪ .‬ﺷـﺮﻁ ﻻﺯﻡ‬

‫) ‪ ∑ d i‬ﺯﻭﺝ( ﺑﻪ ﻃﻮﺭ ﺿﻤﻨﻲ ﺩﺭ ﺍﻳﻦ ﻣﺸﺨﺺ ﺳﺎﺯﻱ ﻭﺟﻮﺩ ﺩﺍﺭﺩ‪ .‬ﭼﻮﻥ ∆‪ d ′, ∑ d i′ = ( ∑ d i ) − 2‬ﺑﺎﻳـﺪ ﺩﺍﺭﺍﻱ‬

‫ﻣﺠﻤﻮﻉ ﺯﻭﺝ ﺑﺮﺍﻱ ﺗﺤﻘﻖ ﭘﺬﻳﺮﻱ ﺑﺎﺷﺪ‪ ،‬ﺍﺯ ﺍﻳﻦ ﺷﺮﻁ ﺑﺎﺯﮔﺸﺘﻲ ﺍﻳﺠﺎﺏ ﻣﻲ ﻛﻨﺪ ﻛﻪ ‪ d‬ﻧﻴـﺰ ﺑﺎﻳـﺪ ﻣﺠﻤـﻮﻉ ﺯﻭﺝ‬

‫ﺩﺍﺷﺘﻪ ﺑﺎﺷﺪ‪.‬‬
‫ﻭ ﺩﺭ ﺍﻧﺘﻬﺎ ﺗﻨﻬﺎ ﻣﻄﻠﺒﻲ ﻛﻪ ﺍﺯ ﻣﺒﺤﺚ ﺩﺭﺟﻪ ﺭﺍﺳﻬﺎ ﺑﺎﻗﻲ ﻣﺎﻧﺪﻩ ﻭ ﻣﻬﻢ ﺍﺳﺖ ﻛﻪ ﺍﻛﻨﻮﻥ ﺗﻌﺮﻳﻒ ﺷﻮﺩ ﺍﮔﺮ ﭼﻪ‬

‫ﻛﺎﺭﺑﺮﺩ ﺁﻥ ﺩﺭ ﻣﺒﺎﺣﺚ ﮔﺮﺍﻓﻬﺎﻱ ﺟﻬﺖ ﺩﺍﺭ ﺍﺳﺖ ﻋﺒﺎﺭﺗﺴﺖ ﺍﺯ‪:‬‬

‫ﺩﺭﺟﻪ ﻫﺎ ﺩﺭ ﮔﺮﺍﻓﻬﺎﻱ ﺟﻬﺖ ﺩﺍﺭ‪:‬‬

‫ﻧﻤﺎﺩﮔﺬﺍﺭﻱ ﺩﺭﺟﻪ ﺭﺍﺱ ﺑﺮﺍﻱ ﮔﺮﺍﻓﻬﺎﻱ ﺟﻬﺖ ﺩﺍﺭ ﻭﺟﻪ ﺗﻤﺎﻳﺰ ﻣﻴﺎﻥ ﺳﺮﻫﺎ ﻭ ﺩﻣﻬﺎﻱ ﻳﺎﻟﻬﺎ ﺭﺍ ﺷﺎﻣﻞ ﻣﻲ ﺷﻮﺩ‪.‬‬

‫ﺗﻌﺮﻳﻒ‪ .‬ﻓﺮﺽ ﻛﻨﻴﻢ ‪ v‬ﺭﺍﺳﻲ ﺩﺭ ﻳﻚ ﮔﺮﺍﻑ ﺟﻬﺖ ﺩﺍﺭ ﺑﺎﺷﺪ‪ .‬ﺩﺭﺟﻪ ﺧﺮﻭﺟﻲ )‪ d + (v‬ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎﻱ ﺑﺎ ﺩﻡ‬

‫‪ v‬ﺍﺳﺖ‪ .‬ﺩﺭﺟﻪ ﻭﺭﻭﺩﻱ )‪ d − (v‬ﺗﻌﺪﺍﺩ ﻳﺎﻟﻬﺎﻱ ﺑﺎ ﺳﺮ ‪ v‬ﺍﺳﺖ‪ .‬ﻫﻤﺴﺎﻳﮕﻲ ﺧﺮﻭﺟﻲ ﻳﺎ ﻣﺠﻤﻮﻋـﻪ ﺗـﺎﻟﻲ )‪N + (v‬‬

‫ﻋﺒﺎﺭﺕ ﺍﺳﺖ ﺍﺯ }‪ . {x ∈ V (G ) : v → x‬ﻫﻤـﺴﺎﻳﮕﻲ ﻭﺭﻭﺩﻱ ﻳـﺎ ﻣﺠﻤﻮﻋـﻪ ﻣﻘـﺪﻡ )‪ N − (v‬ﻋﺒـﺎﺭﺕ ﺍﺳـﺖ ﺍﺯ‬

‫}‪. {x ∈ V (G ) : x → v‬‬

‫(‬ ‫)‬
‫ﺑﺮﺍﻱ ﮔﺮﺍﻓﻬﺎﻱ ﺟﻬﺖ ﺩﺍﺭ ﺩﻧﺒﺎﻟﻪ ﺍﻱ ﺍﺯ )) ﺟﻔﺘﻬﺎﻱ ﺩﺭﺟﻪ (( ) ‪ d + (v i ), d − (v i‬ﺭﺍ ﺩﺍﺭﻳـﻢ‪ .‬ﺑـﺴﻴﺎﺭﻱ ﺍﺯ‬

‫‪n‬‬
‫‪ ‬‬
‫ﻧﺘﺎﻳﺞ ﺑﻪ ﺩﺳﺖ ﺁﻣﺪﻩ ﺍﺯ ﮔﺮﺍﻓﻬﺎ ﺷﺒﻴﻪ ﻧﺘﺎﻳﺞ ﺣﺎﺻﻞ ﺍﺯ ﮔﺮﺍﻓﻬﺎﻱ ﺟﻬﺖ ﺩﺍﺭ ﺍﺳﺖ‪ 2 2  .‬ﮔﺮﺍﻑ ﺳـﺎﺩﻩ ﺑـﺎ ﺭﺍﺳـﻬﺎﻱ‬

‫‪2‬‬
‫‪ v n ,...,v1‬ﻭﺟﻮﺩ ﺩﺍﺭﻧﺪ‪ .‬ﺑﻪ ﻃﻮﺭ ﻣﺸﺎﺑﻬﻲ‪ 2n ،‬ﮔﺮﺍﻑ ﺟﻬﺖ ﺩﺍﺭ ﺑﺎ ﺍﻳﻦ ﺭﺍﺳﻬﺎ ﻭﺟﻮﺩ ﺩﺍﺭﻧﺪ ﺑﻪ ﻃﻮﺭﻱ ﻛﻪ ﻫﺮ ﺟﻔﺖ‬

‫ﻣﺮﺗﺐ ﺣﺪﺍﻛﺜﺮ ﻳﻚ ﺑﺎﺭ ﺑﻪ ﻋﻨـﻮﺍﻥ ﻳـﻚ ﻳـﺎﻝ ﻇـﺎﻫﺮ ﻣـﻲ ﺷـﻮﺩ‪ .‬ﺍﮔـﺮ ﻭﺟـﻮﺩ ﻃﻮﻗـﻪ ﻫـﺎ ﻭ ﺩﺍﺷـﺘﻦ ﻫـﺮ ﺩﻭﻱ‬

‫‪n‬‬
‫‪2‬‬
‫‪ 3‬ﮔﺮﺍﻑ ﺟﻬﺖ ﺩﺍﺭ ﺑﺎﻗﻲ ﻣﻲ ﻣﺎﻧﺪ؛ ﺍﻳﻨﻬﺎ ﺑﺎ ﮔﺮﺍﻓﻬﺎﻱ ﺳﺎﺩﻩ ﺍﺭﺗﺒـﺎﻁ‬ ‫‪ ‬‬
‫‪ y → x, x → y‬ﺭﺍ ﻣﻨﻊ ﻛﻨﻴﻢ‪ ،‬ﺁﻧﮕﺎﻩ ﺗﻨﻬﺎ‬

‫ﻧﺰﺩﻳﻜﻲ ﺩﺍﺭﻧﺪ‪.‬‬