Graph Theory book or literature that dives into these concepts

Click For Summary
SUMMARY

The discussion centers on the need for literature that clarifies concepts in Frank Harary's graph theory book, specifically regarding boundary and cycle vectors. The finite field \(\mathbb{Z}^2\) is equivalent to Harary's \(\mathbb{F}_2\). Additionally, the term "boundary" is used in a topological context to refer to endpoints, which is crucial for understanding closed loops in graph theory. The Wikipedia article on cycle spaces is recommended as a resource, along with literature on chains and boundaries in topology.

PREREQUISITES
  • Understanding of basic graph theory concepts
  • Familiarity with finite fields, specifically \(\mathbb{F}_2\)
  • Knowledge of topology, particularly chains and boundaries
  • Ability to interpret academic literature in mathematics
NEXT STEPS
  • Research the Wikipedia article on cycle spaces for foundational knowledge
  • Explore literature on chains and boundaries in topology
  • Read Frank Harary's book on graph theory for context
  • Investigate additional resources on finite fields and their applications
USEFUL FOR

Mathematicians, students of graph theory, and anyone seeking to deepen their understanding of topological concepts related to graph structures.

Terrell
Messages
316
Reaction score
26
I need recommendations on literature to read. Basically i do not understand these section of Frank Harary's book on graph theory since the definition of what a boundary and a cycle vector is not clearly defined. I have googled literature on it but I am having a tough time finding the right literature. I attached an image of a page in the book. please see below. thanks!
 

Attachments

  • what.png
    what.png
    69.9 KB · Views: 511
Physics news on Phys.org
You might want to try the Wikipedia article for cycle spaces: https://en.m.wikipedia.org/wiki/Cycle_space

Note that the finite field \mathbb Z^2 is the same as what Harary calls \mathbb F_2.

Also, he's using the word boundary to mean endpoints. A closed loop has no endpoints. His choice of language makes sense because he's speaking topologically. Look up some literature on chains and boundaries in topology and you can see how subsets of graphs are very simple examples of chains in topology.

The Wikipedia article I linked has a decent list of references you might want to check some of, by the way.
 
  • Like
Likes   Reactions: Terrell

Similar threads

  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 1 ·
Replies
1
Views
483
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K