Elements of graph theory. From basic concepts to modern developments (Q2679076)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Elements of graph theory. From basic concepts to modern developments
scientific article

    Statements

    Elements of graph theory. From basic concepts to modern developments (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2023
    0 references
    ``This book is an introduction to graph theory, presenting most of its elementary and classical notions through an original and rigorous approach, including detailed proofs of most the results. It covers all aspects of graph theory from an algebraic, topological and analytic point of view, while also developing the theory's algorithmic parts. The book will be useful to undergraduate students in computer science and mathematics as well as in engineering, but it is also intended for graduate students and experienced researchers wanting to learn more about graphs. The original edition of this book appeared in 2012. In the second edition, still written in French, appeared in 2018 contains additional developements on the spectral theory of graphs, random graphs and weighted graphs. The present English edition is based on the enlarged second French edition'' (from the presentation). The chapters of the book are the following: Basic concepts, Some remarkable graphs, (Di)graphs and data structures, Connectedness and flows in networks, Planar graphs, Graphs and linear algebra, Colourings, Matching and factorisation, Graphs and group theory, Spectral theory and applications, Random graphs, Weighted graphs and their applications (The Laplacian in physics, Random walks in graphs, Electrical networks, Cheeger's inequality), Other perspectives (Tutte polynomials, Ramsey theory, Matroids, Hypergraphs), References, Index, Symbols used. This book also contains a few exercises, elements of plane topology and geometry, a background in linear algebra and in probability theory, and is well-written in an attractive style.
    0 references
    digraphs
    0 references
    data structures
    0 references
    connectedness in networks
    0 references
    flows in networks
    0 references
    planar graphs
    0 references
    colourings
    0 references
    matching
    0 references
    random graphs
    0 references
    weighted graphs
    0 references
    applications
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references