Skip to main content
Elsevier
View Cart
My account

Books in Discrete mathematics combinatorics

BooksJournals

    • An Introduction to Discrete Mathematics

      • 1st Edition
      • May 12, 2025
      • Vidyadhar Kulkarni
      • English
      • Paperback
        9 7 8 0 4 4 3 2 4 8 4 8 1
      • eBook
        9 7 8 0 4 4 3 2 4 8 5 0 4
      An Introduction to Discrete Mathematics offers an engaging and accessible introduction to discrete mathematics for beginning undergraduate students across a wide range of application areas, from mathematics to statistics, operations research, business, engineering, and the sciences. It provides solid foundation in precise proof writing methods, with early chapters introducing set theory and logic that are followed by deductive and inductive proof techniques, number theory, counting principles, permutations and combinations, probability of events, random variables, graphs, and weighted graphs.The book illustrates fundamental concepts in discrete mathematics with clear and precise definitions that are paired with examples and counter-examples as applied in combinatorics, discrete probability, and graph theory. Chapters include student exercises to enhance learning, and a solutions manual and example questions are available for instructors on a companion website.

    • Discrete Mathematics With Logic

      • 1st Edition
      • July 20, 2023
      • Martin Milanic + 2 more
      • English
      • Paperback
        9 7 8 0 4 4 3 1 8 7 8 2 7
      • eBook
        9 7 8 0 4 4 3 1 8 7 8 3 4
      Discrete Mathematics provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics without assuming any background in algebra or computational skills and without duplicating what they will learn in higher level courses. The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction. For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises.

    • Discrete Mathematics

      • 1st Edition
      • April 29, 2022
      • Ali Grami
      • English
      • Paperback
        9 7 8 0 1 2 8 2 0 6 5 6 0
      • eBook
        9 7 8 0 1 2 8 2 0 9 0 9 7
      Discrete Mathematics: Essentials and Applications offers a comprehensive survey of the area, particularly concentrating on the basic principles and applications of Discrete Mathematics. This up-to-date text provides proofs of significance, keeping the focus on numerous relevant examples and many pertinent applications. Written in a simple and clear tone, the title features insightful descriptions and intuitive explanations of all complex concepts and ensures a thorough understanding of the subject matter.

    • A Collection of Contributions in Honour of Jack van Lint

      • 1st Edition
      • June 6, 2016
      • P.J. Cameron + 1 more
      • English
      • eBook
        9 7 8 1 4 8 3 2 9 4 1 9 3
      This collection of contributions is offered to Jack van Lint on the occasion of his sixtieth birthday and appears simultaneously in the series Topics in Discrete Mathematics and as a special double volume of Discrete Mathematics (Volumes 106/107). It is hoped that the papers selected, all written by experts in their own fields, represent the many interesting areas that together constitute the discipline of Discrete Mathematics. It is in this sphere that van Lint has become the acknowledged master and this expansive volume serves to demonstrate the enormous significance he has had on the development of Discrete Mathematics during the last 30 years.

    • The Julius Petersen Graph Theory Centennial

      • 1st Edition
      • June 6, 2016
      • L.D. Andersen + 7 more
      • English
      • eBook
        9 7 8 1 4 8 3 2 9 6 3 2 6
      Julius Petersen's paper, Die Theorie der regulären graphs in Acta Mathematica, volume 15 (1891), stands at the beginning of graph theory as we know it today.The Danish group of graph theorists decided in 1985 to mark the 150th birthday of Petersen in 1989, as well as the centennial of his paper.It was felt that the occasion called for a presentation of Petersen's famous paper in its historical context and, in a wider sense, of Petersen's life and work as a whole. However, the readily available information about Julius Petersen amounted to very little (not even a full bibliography existed) and virtually nothing was known about the circumstances that led him to write his famous paper.The study of Petersen's life and work has resulted in several papers, in particular a biography, a bibliography, an annotated edition of the letters surrounding Petersen's paper of 1891, an analysis of Petersen's paper and an annotated edition of parts of Petersen's correspondence with Sylow on Galois theory. The first four of these papers, together with a survey of matching theory, form the first part of this book. In addition to these five special papers, there are papers submitted in the celebration of the Petersen centennial.

    • Directions in Infinite Graph Theory and Combinatorics

      • 1st Edition
      • Volume 3
      • June 6, 2016
      • R. Diestel
      • English
      • eBook
        9 7 8 1 4 8 3 2 9 4 7 9 7
      This book has arisen from a colloquium held at St. John's College, Cambridge, in July 1989, which brought together most of today's leading experts in the field of infinite graph theory and combinatorics. This was the first such meeting ever held, and its aim was to assess the state of the art in the discipline, to consider its links with other parts of mathematics, and to discuss possible directions for future development. This volume reflects the Cambridge meeting in both level and scope. It contains research papers as well as expository surveys of particular areas. Together they offer a comprehensive portrait of infinite graph theory and combinatorics, which should be particularly attractive to anyone new to the discipline.

    • Designs and Graphs

      • 1st Edition
      • Volume 4
      • June 6, 2016
      • C.J. Colbourn + 2 more
      • English
      • eBook
        9 7 8 1 4 8 3 2 9 4 7 5 9
      In 1988, the news of Egmont Köhler's untimely death at the age of 55reached his friends and colleagues. It was widely felt that a lastingmemorial tribute should be organized. The result is the present volume,containing forty-two articles, mostly in combinatorial design theory andgraph theory, and all in memory of Egmont Köhler. Designs and graphswere his areas of particular interest; he will long be remembered for hisresearch on cyclic designs, Skolem sequences, t-designs and theOberwolfach problem. Professors Lenz and Ringel give a detailedappreciation of Köhler's research in the first article of thisvolume.There is, however, one aspect of Egmont Köhler's biographythat merits special attention. Before taking up the study of mathematics atthe age of 31, he had completed training as a musician (studying bothcomposition and violoncello at the Musikhochschule in Berlin), and workedas a cellist in a symphony orchestra for some years. This accounts for hisinterest in the combinatorial aspects of music. His work and lectures inthis direction had begun to attract the interest of many musicians, and hehad commenced work on a book on mathematical aspects of musical theory. Itis tragic indeed that his early death prevented the completion of his work;the surviving paper on the classification and complexity of chordsindicates the loss that his death meant to the area, as he was almostuniquely qualified to bring mathematics and music together, being aprofessional in both fields.

    • Interconnection Networks

      • 1st Edition
      • Volume 5
      • June 6, 2016
      • J.-C. Bermond
      • English
      • eBook
        9 7 8 1 4 8 3 2 9 5 2 7 5
      Most of the articles in this book deal with static or point-to-pointInterc... Networks. In particular, new constructions are proposed basedon different tools from discrete mathematics. Many new records have beenestablished in the table of the maximum number of vertices of graphs withmaximum degree &Dgr; and diameter D. Properties of thesenetworks (and of more classical ones) are analyzed in many of the otherpapers. About 40% of the articles deal with fault tolerance orvulnerability properties using either combinatorial tools or probabilisticones.

    • Fixed Point Theory and Graph Theory

      • 1st Edition
      • June 10, 2016
      • Monther Alfuraidan + 1 more
      • English
      • Hardback
        9 7 8 0 1 2 8 0 4 2 9 5 3
      • eBook
        9 7 8 0 1 2 8 0 4 3 6 5 3
      Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions under which maps (single or multivalued) have solutions and graph theory which uses mathematical structures to illustrate the relationship between ordered pairs of objects in terms of their vertices and directed edges. This edited reference work is perhaps the first to provide a link between the two theories, describing not only their foundational aspects, but also the most recent advances and the fascinating intersection of the domains. The authors provide solution methods for fixed points in different settings, with two chapters devoted to the solutions method for critically important non-linear problems in engineering, namely, variational inequalities, fixed point, split feasibility, and hierarchical variational inequality problems. The last two chapters are devoted to integrating fixed point theory in spaces with the graph and the use of retractions in the fixed point theory for ordered sets.

    • Bent Functions

      • 1st Edition
      • August 6, 2015
      • Natalia Tokareva
      • English
      • Paperback
        9 7 8 0 1 2 8 0 2 3 1 8 1
      • eBook
        9 7 8 0 1 2 8 0 2 5 5 5 0
      Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions. The text is appropriate for novices and advanced researchers, discussing proofs of several results, including the automorphism group of bent functions, the lower bound for the number of bent functions, and more.