Bøger af W.D. Wallis

Concisely written, gentle introduction to graph theory suitable as a textbook or for self-studyGraph-theoretic applications from diverse fields (computer science, engineering, chemistry, management science)2nd ed.

Contains 21 selected or consolidated papers presented at an international conference in April 1988 at Tunxi (Hunangshan), China.

This concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings and its application to a number of new areas. It may serve as a graduate text for courses and seminars in mathematics or computer science, or as a professional text for the researcher.

Bipartite graphs contain only cycles of even lengths, a bipancyclic graph is defined to be a bipartite graph with cycles of every even size from 4 vertices up to the number of vertices in the graph.

This title takes an in-depth look at the mathematics in the context of voting and electoral systems, with focus on simple ballots, complex elections, fairness, approval voting, ties, fair and unfair voting, and manipulation techniques.

This concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings and its application to a number of new areas. It may serve as a graduate text for courses and seminars in mathematics or computer science, or as a professional text for the researcher.

Wallis's book on discrete mathematics is a resource for an introductory course in a subject fundamental to both mathematics and computer science, a course that is expected not only to cover certain specific topics but also to introduce students to important modes of thought specific to each discipline .

This second edition of A Beginner's Guide to Finite Mathematics takes a distinctly applied approach to finite mathematics at the freshman and sophomore level. Requiring little mathematical background beyond high school algebra, the text will be especially useful for business and liberal arts majors.

An advanced reference containing 21 selected or consolidated papers presented at an international conference in April 1988 at Tunxi (now Hunangshan), China. Contains recent, previously unavailable findings of Chinese mathematicians; discusses problems, results, and proving methods of combinatorial d

Offers an introduction to the areas of design theory as well as to more contemporary designs based on applications in a variety of fields. This work also introduces balanced designs and finite geometries. It then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability.

The topic of one-factorizations fits into the theory of combinatorial designs just as much as it does into graph theory. It is expected that nearly all readers will have some background in the theory of graphs, such as an advanced undergraduate course in Graph Theory or Applied Graph Theory.