|
|
[½»Á÷]
2-Á¬Í¨ [4 ,2] -ͼÖеÄȦ ÒÔ¼°º¬ÓÐHamilton ȦµÄÒ»¸ö³ä·ÖÌõ¼þµÄÔÙÖ¤Ã÷
2-Á¬Í¨ [4 ,2] -ͼÖеÄȦ ÒÔ¼°º¬ÓÐHamilton ȦµÄÒ»¸ö³ä·ÖÌõ¼þµÄÔÙÖ¤Ã÷
ÕªÒª£ºÍ¼ÂÛ(Graph Theory)µÄÑо¿¿ªÊ¼ÓÚ200¶àÄêǰ, ¹ØÓÚͼÂ۵ĵÚһƪÂÛÎÄÊÇ1736ÄêEuler·¢±íµÄ, ËûÓÃͼÂ۵ķ½·¨½â¾öÁ˸ñÄá˹±¤(Konigsberg)ÆßÇÅÎÊÌâ. ͼµÄHamiltonÎÊÌâÊÇͼÂÛÖÐÒ»¸öÊ®·ÖÖØÒªÇÒÓÖÊ®·Ö»îÔ¾µÄÑо¿¿ÎÌâ, 1857Äê, °®¶ûÀ¼Êýѧ¼Ò¹þÃܶÙÌá³ö:Ò»¸öÁ¬Í¨Í¼ÓйþÃܶÙȦµÄ³äÒªÌõ¼þÊÇʲô?ÕâÑùÒ»¸öÎÊÌâ. µ«ÊÇÕâ¸öÎÊÌâÖÁ½ñÈÔδÄܽâ¾ö, ÒÔHamiltonÎÊÌâΪ³ö·¢µã·¢Õ¹ÆðÁ˶ÔͼµÄȦÐÔÖʵÄÑо¿, ÕâЩÐÔÖÊÖ÷Òª°üÀ¨HamiltonÐÔ¡¢·ºÈ¦ÐÔ¡¢ÍêȫȦ¿ÉÀ©ÐÔµÈ. ±¾ÎĵÄÖ÷ÒªÄÚÈݰüÀ¨Èý¸ö²¿·Ö: ÔÚµÚÒ»²¿·ÖÖÐÖ÷Òª½éÉÜÁËÎÄÕÂÖÐËùÉæ¼°µÄһЩ¸ÅÄî¡¢ÊõÓï·ûºÅºÍ±¾ÎĵÄÑо¿±³¾°¼°ÒÑÓеĽá¹û£»ÔÚµÚ¶þ²¿·ÖÖÐÌÖÂÛ2-Á¬Í¨
[4,2]-ͼÖеÄȦ£»ÔÚµÚÈý²¿·ÖÖÐÌÖÂÛÁËͼÖк¬ÓÐHamiltonȦµÄÒ»¸ö³ä·ÖÌõ¼þ.
¹Ø¼ü´Ê£º[s, t]-ͼ£»Á¬Í¨¶È£»s-µãÁ¬Í¨Í¼£»ÍêȫȦ¿ÉÀ©ÐÔ£»×Ȧ£»HamiltonȦ£»¶ÀÁ¢Êý
ÖÐͼ·ÖÀàºÅ: O 157. 5
The Cycles in 2-connected[4,2]-graphs and another proof of a sufficient condition for the graph containing Hamilton cycles
Abstract: Graph Theory began 200 years ago, Euler published the first paper on graph theory in 1736, he used graph theory to solve the Konigsberg Seven Bridges. the Hamilton problem is a very important and active research topic in graph theory, In 1857, Irish mathematician Hamilton put forward a problem: ¡°what is the necessary and sufficient condition when a connected graph has a Hamilton cycle.¡± However, it has not been solved until now, At the same time based on Hamilton problem, a research on natures of cycles in graph has been carried out. These natures are hamiltonicity, pancyclicity, extensibility etc. The main content of this paper consists of three parts: in the first part introduces some of the concepts terms symbols covered in the article, and the research background and the existing results; in the second part we discussed the cycles in 2-connected[4, 2]-graphs; in the third part we discussed a sufficient condition for the graph contains Hamilton cycle.
Key words: [s,t]-graph; connectivity; s-vertices connected graph; fully cycle extensibility; the longest cycle; Hamilton cycle; independence number![2-Á¬Í¨ [4 ,2] -ͼÖеÄȦ ÒÔ¼°º¬ÓÐHamilton ȦµÄÒ»¸ö³ä·ÖÌõ¼þµÄÔÙÖ¤Ã÷]()
2-Á¬Í¨ [4 ,2] -ͼÖеÄȦ ÒÔ¼°º¬ÓÐHamilton ȦµÄÒ»¸ö³ä·ÖÌõ¼þµÄÔÙÖ¤Ã÷0.jpg
![2-Á¬Í¨ [4 ,2] -ͼÖеÄȦ ÒÔ¼°º¬ÓÐHamilton ȦµÄÒ»¸ö³ä·ÖÌõ¼þµÄÔÙÖ¤Ã÷-1]()
2-Á¬Í¨ [4 ,2] -ͼÖеÄȦ ÒÔ¼°º¬ÓÐHamilton ȦµÄÒ»¸ö³ä·ÖÌõ¼þµÄÔÙÖ¤Ã÷1.jpg |
» ±¾Ìû¸½¼þ×ÊÔ´Áбí
» ²ÂÄãϲ»¶
|