Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This book is suitable for both undergraduate students (first year calculus and undergraduate graph theory) and post-graduate students (algebraic graph theory and combinatorics). The main thrust of the book involves the join between graph theory and calculus, by introducing 10 different ratios involving graph theoretical concepts. When these ratios are a function f(n), of the order n of graphs G belonging to a class of graphs, then the horizontal asymptotic behavior of f(n) becomes significant in terms of practical applications, when a large number of vertices are involved, such as in networks, or molecules with a large number of atoms. Moreover, by attaching the average degree of G (the length of G) to the Riemann integral of f(n) (the height of G) the idea of area becomes relevant in terms of this ratio involving such classes of graphs. These ratios have realized such aspects as: - Asymptotic convergence of 1/e identical to the famous secretary problem. - The chromatic number and energy of a graph G is compared to the same for the complete graph and the idea of domination involving these properties is investigated - Sequences, as a subsequence of the Farey sequence.
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This book is suitable for both undergraduate students (first year calculus and undergraduate graph theory) and post-graduate students (algebraic graph theory and combinatorics). The main thrust of the book involves the join between graph theory and calculus, by introducing 10 different ratios involving graph theoretical concepts. When these ratios are a function f(n), of the order n of graphs G belonging to a class of graphs, then the horizontal asymptotic behavior of f(n) becomes significant in terms of practical applications, when a large number of vertices are involved, such as in networks, or molecules with a large number of atoms. Moreover, by attaching the average degree of G (the length of G) to the Riemann integral of f(n) (the height of G) the idea of area becomes relevant in terms of this ratio involving such classes of graphs. These ratios have realized such aspects as: - Asymptotic convergence of 1/e identical to the famous secretary problem. - The chromatic number and energy of a graph G is compared to the same for the complete graph and the idea of domination involving these properties is investigated - Sequences, as a subsequence of the Farey sequence.