شمارش گرافیکی

Graphical Enumeration deals with the enumeration of various kinds of graphs. Topics covered range from labeled enumeration and George Pólya's theorem to rooted and unrooted trees, graphs and digraphs, and power group enumeration. Superposition, blocks, and asymptotics are also discussed. A number of unsolved enumeration problems are presented. Comprised of 10 chapters, this book begins with an overview of labeled graphs, followed by a description of the basic enumeration theorem of Pólya. The next three chapters count an enormous variety of trees, graphs, and digraphs. The Power Group Enumeration Theorem is then described together with some of its applications, including the enumeration of self-complementary graphs and digraphs and finite automata. Two other chapters focus on the counting of superposition and blocks, while another chapter is devoted to asymptotic numbers that are developed for several different graphical structures. The book concludes with a comprehensive definitive list of unsolved graphical enumeration problems. This monograph will be of interest to both students and practitioners of mathematics. The book is a definitive treatise on the enumeration of graphs and related structural configurations, providing historical results as well as recent developments having potential application in the fields of physics, chemistry, computer science, and electrical engineering. Its ten chapters cover the subjects of labeled enumeration, Polya's Theorem, trees, graphs, diagraphs, power group enumeration, superposition, blocks, asymptotics, and as a special feature, a new comprehensive list of unsolved graphical enumeration problems. It includes an extensive bibliography and numerous exercises ranging in difficulty from routine to intractable. [by] Frank Harary [and] Edgar M. Palmer. Bibliography: P. 253-261.