木ã®ç›´å¾„を求ã‚るアルゴリズム- ペケンペイã®ãƒ–ãƒã‚°æ³¨æ„：è°è«–ãŒæ´—ç·´ã•ã‚Œã¦ãŠã‚‰ãšã€çœŸé¢ç›®ã«èªã‚€ã¹ã記事ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ä¿¡é ¼ã§ããã†ãªã‚°ãƒ©ãƒ•ç†è«–ã®æ›¸ç±ã‚’èªã‚“ã ã»ã†ãŒè‰¯ã„ã¨æ€ã„ã¾ã™ã€‚ウェブ上ã§é–²è¦§ã§ãる資料ã¨ã—ã¦ã¯ä»¥ä¸‹ãŒã‚ã‚Šã€ãã“ã® References を辿るã¨è‰¯ã„ã§ã—ょã†ã€‚ http://mathworld.wolfram.com/GraphCenter.html ä¸å¿ƒãŒé«˜ã€… 2 個ã§ã‚ã‚‹ã“ã¨ã¨ã€2 個ã‚ã‚‹ãªã‚‰ã°ãれらã¯éš£æŽ¥ã—ã¦ã„ã‚‹ã“ã¨ã¯ F. Harary ã® ''Graph Theory'' ã«è¨¼æ˜ŽãŒã‚ã‚Šã¾ã™ã€‚p. 35 ã® Theorem 4.2 Every tree has a center consisting of either one point or two adjacent points. ãŒãã‚Œã§ã™ã€‚é »ç¹ã«å‚ç…§ã•ã‚Œã‚‹è¨˜äº‹ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã®ã§ã€ã“ã®è¨˜äº‹ã‚’改訂ã™ã‚‹äºˆå®šã¯ä»Šã®æ‰€ã‚ã‚Šã¾ã›ã‚“ãŒã€å¹¾ã‚‰ã‹æ€ã†ã¨ã“ã‚ãŒã‚ã‚‹ã®ã§å¸Œæœ›ãŒã‚ã‚Œã°
{{#tags}}- {{label}}
{{/tags}}