# Research paper in graph theory

If it is not empty, it consists of a distinguished node r called the root and zero or more non-empty subtrees T1, T2, …, Tk such that there is a directed edge from r to each of the roots of T1, T2, …, Tk. A forest is a collection of trees. You can always create a tree form a forest by creating a new root node and making it the parent of the roots of all of the trees in the forest. Conversely, if you lop off the root of a tree, what is left is a forest. I assume that you are familiar with the terminology of binary trees, e.

## Publications

## The Writings of Leslie Lamport

Graph theory is the area of?? A graph is a set of points called nodes or corners, connected by lines, called arcs or edges. The reason for choosing the word nodes and arcs or edges and corners instead of points and lines is that the edges and corners lack the usual Euclidean properties of points and lines. You can add multiple points on the same line, but an edge can only go between a maximum of two corners. The edge may go back to the same corner, when it is then called a loop. It is possible that multiple edges between the same pair of vertices, which are called multiple edges.

### My Writings

Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up. Connect and share knowledge within a single location that is structured and easy to search. I have a very generic question to ask.

This is a list of graph theory topics , by Wikipedia page. See glossary of graph theory terms for basic terminology. See list of network theory topics. From Wikipedia, the free encyclopedia. Wikipedia list article.