Graph Theory and Computing
eBook - PDF

Graph Theory and Computing

  1. 344 pages
  2. English
  3. PDF
  4. Only available on web
eBook - PDF

Graph Theory and Computing

Book details
Table of contents
Citations

About This Book

Graph Theory and Computing focuses on the processes, methodologies, problems, and approaches involved in graph theory and computer science. The book first elaborates on alternating chain methods, average height of planted plane trees, and numbering of a graph. Discussions focus on numbered graphs and difference sets, Euclidean models and complete graphs, classes and conditions for graceful graphs, and maximum matching problem. The manuscript then elaborates on the evolution of the path number of a graph, production of graphs by computer, and graph-theoretic programming language. Topics include FORTRAN characteristics of GTPL, design considerations, representation and identification of graphs in a computer, production of simple graphs and star topologies, and production of stars having a given topology. The manuscript examines the entropy of transformed finite-state automata and associated languages; counting hexagonal and triangular polyominoes; and symmetry of cubical and general polyominoes. Graph coloring algorithms, algebraic isomorphism invariants for graphs of automata, and coding of various kinds of unlabeled trees are also discussed. The publication is a valuable source of information for researchers interested in graph theory and computing.

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Graph Theory and Computing by Ronald C. Read in PDF and/or ePUB format, as well as other popular books in Mathematics & Mathematics General. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Academic Press
Year
2014
ISBN
9781483263120
Topic
Mathematics
Subtopic
Mathematics General
Index
Mathematics

Table of contents

  1. Front Cover
  2. Graph Theory and Computing
  3. Copyright Page
  4. Table of Contents
  5. LIST OF CONTRIBUTORS
  6. PREFACE
  7. CHAPTER 1. ALTERNATING CHAIN METHODS: A SURVEY
  8. CHAPTER 2. THE AVERAGE HEIGHT OF PLANTED PLANE TREES
  9. CHAPTER 3. HOW TO NUMBER A GRAPH
  10. CHAPTER 4. EVOLUTION OF THE PATH NUMBER OF A GRAPH: COVERING AND PACKING IN GRAPHS, II
  11. CHAPTER 5. THE PRODUCTION OF GRAPHS BY COMPUTER
  12. CHAPTER 6. A GRAPH-THEORETIC PROGRAMMING LANGUAGE
  13. CHAPTER 7. ENTROPY OF TRANSFORMED FINITE-STATE AUTOMATA AND ASSOCIATED LANGUAGES
  14. CHAPTER 8. COUNTING HEXAGONAL AND TRIANGULAR POLYOMINOES
  15. CHAPTER 9. SYMMETRY OF CUBICAL AND GENERAL POLYOMINOES
  16. CHAPTER 10. GRAPH COLORING ALGORITHMS
  17. CHAPTER 11. ALGEBRAIC ISOMORPHISM INVARIANTS FOR GRAPHS OF AUTOMATA
  18. CHAPTER 12. THE CODING OF VARIOUS KINDS OF UNLABELED TREES
  19. CHAPTER 13. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
  20. CHAPTER 14. INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS
  21. CHAPTER 15. AN ALGORITHM FOR A GENERAL CONSTRAINED SET COVERING PROBLEM
  22. CHAPTER 16. TRIPARTITE PATH NUMBERS
  23. CHAPTER 17. NON-HAMILTONIAN PLANAR MAPS
  24. CHAPTER 18. A TOP-DOWN ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL LEXICOGRAPHIC TREES
  25. INDEX