Applied Graph Theory: An Introduction With Graph Optimization And Algebraic Graph Theory

Applied Graph Theory: An Introduction With Graph Optimization And Algebraic Graph Theory (English, Hardcover, Griffin Christopher H)

Share

Applied Graph Theory: An Introduction With Graph Optimization And Algebraic Graph Theory  (English, Hardcover, Griffin Christopher H)

Be the first to Review this product
Special price
₹2,850
3,800
25% off
i
Coupons for you
  • Special PriceGet extra 25% off on 20 items (price inclusive of cashback/coupon)
    T&C
  • Available offers
  • Bank Offer5% cashback on Flipkart Axis Bank Credit Card upto ₹4,000 per statement quarter
    T&C
  • Bank Offer5% cashback on Axis Bank Flipkart Debit Card up to ₹750
    T&C
  • Bank OfferFlat ₹10 Instant Cashback on Paytm UPI Trxns. Min Order Value ₹500. Valid once per Paytm account
    T&C
  • EMI starting from ₹101/month
  • Delivery
    Check
    Enter pincode
      Delivery by5 Aug, Tuesday
      ?
    View Details
    Author
    Read More
    Highlights
    • Language: English
    • Binding: Hardcover
    • Publisher: World Scientific Publishing Co Pte Ltd
    • Genre: Mathematics
    • ISBN: 9789811273100
    • Pages: 304
    Services
    • Cash on Delivery available
      ?
    Seller
    thankamaribooks
    (Not Enough Ratings)
    • 7 Days Replacement Policy
      ?
  • See other sellers
  • Description
    This book serves as an introduction to graph theory and its applications. It is intended for a senior undergraduate course in graph theory but is also appropriate for beginning graduate students in science or engineering. The book presents a rigorous (proof-based) introduction to graph theory while also discussing applications of the results for solving real-world problems of interest. The book is divided into four parts. Part 1 covers the combinatorial aspects of graph theory including a discussion of common vocabulary, a discussion of vertex and edge cuts, Eulerian tours, Hamiltonian paths and a characterization of trees. This leads to Part 2, which discusses common combinatorial optimization problems. Spanning trees, shortest path problems and matroids are all discussed, as are maximum flow problems. Part 2 ends with a discussion of graph coloring and a proof of the NP-completeness of the coloring problem. Part 3 introduces the reader to algebraic graph theory, and focuses on Markov chains, centrality computation (e.g., eigenvector centrality and page rank), as well as spectral graph clustering and the graph Laplacian. Part 4 contains additional material on linear programming, which is used to provide an alternative analysis of the maximum flow problem. Two appendices containing prerequisite material on linear algebra and probability theory are also provided.
    Read More
    Specifications
    Imprint
    • World Scientific Publishing Co Pte Ltd
    Manufacturing, Packaging and Import Info
    Be the first to ask about this product
    Safe and Secure Payments.Easy returns.100% Authentic products.
    You might be interested in
    Psychology Books
    Min. 50% Off
    Shop Now
    Other Lifestyle Books
    Min. 50% Off
    Shop Now
    Society And Culture Books
    Min. 50% Off
    Shop Now
    School Textbooks
    Special offer
    Shop Now
    Back to top