CS-104:Graph Theory and Concrete Mathematics

Edit Answers
1234567891011121314151617181920
Across
  1. 2. digraphs where for every edge (a,b) there is edge (b,a)
  2. 5. The algorithm to calculate minimum weighted spanning tree.
  3. 6. the chromatic number of a tree is
  4. 7. the nonplaner graph K5 and K3,3 are known as-
  5. 10. Every two chromatic graph is-
  6. 11. A graph whose vertex connectivity is one.
  7. 12. sum of indegree and outdegree is one then such vertex is
  8. 14. A connected digraph without dicircuits and semicircuits
  9. 15. A walk that is not directed but undirected
  10. 17. A digraph in which for each vertex indegree=outdegree
  11. 19. If a graph on n vertices has chromatic polynomial x(x-1)^(n-1) the it is
  12. 20. A digraph where every vertex has same indegee and outdegree
Down
  1. 1. If x^n is the chromatic polynomial then all vertices of graph must be
  2. 3. A closed diwalkwhich traverses every edge
  3. 4. The number of ...... in a connected graph is e-n+1.
  4. 8. digraph that have at the most one edge between a pair of vertices
  5. 9. a directed tree in which every vertex other than root has indegree exactly one
  6. 11. digraph without self loop and parallel edges
  7. 13. A complete asymmetric digraph
  8. 16. Large marsupial
  9. 18. A minimal set of edges in a connected graph whose removal reduces the rank by one.