| 書目名稱 | Magic Graphs | | 編輯 | W. D. Wallis | | 視頻video | http://file.papertrans.cn/622/621150/621150.mp4 | | 圖書封面 |  | | 描述 | Magic labelings Magic squares are among the more popular mathematical recreations. Their origins are lost in antiquity; over the years, a number of generalizations have been proposed. In the early 1960s, Sedlacek asked whether "magic" ideas could be applied to graphs. Shortly afterward, Kotzig and Rosa formulated the study of graph label- ings, or valuations as they were first called. A labeling is a mapping whose domain is some set of graph elements - the set of vertices, for example, or the set of all vertices and edges - whose range was a set of positive integers. Various restrictions can be placed on the mapping. The case that we shall find most interesting is where the domain is the set of all vertices and edges of the graph, and the range consists of positive integers from 1 up to the number of vertices and edges. No repetitions are allowed. In particular, one can ask whether the set of labels associated with any edge - the label on the edge itself, and those on its endpoints - always add up to the same sum. Kotzig and Rosa called such a labeling, and the graph possessing it, magic. To avoid confusion with the ideas of Sedlacek and the many possible variations, we would call | | 出版日期 | Textbook 20011st edition | | 關鍵詞 | Applications of Mathematics; Combinatorics; Computer; Graph; Graph Theory; computer science; ksa; verificat | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-0123-6 | | isbn_ebook | 978-1-4612-0123-6 | | copyright | Birkh?user Boston 2001 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 15:20
發(fā)表于 2025-3-21 16:17:34
