Across
- 2. A correspondence preserving the structure of graphs
- 3. An algebraic structure with a binary operation and inverses
- 5. A graph in which a path exists between every pair of vertices
- 6. A path or cycle that visits every vertex exactly once
- 7. A function whose every codomain element is an output
- 8. A function that is both one-to-one and onto
- 10. A selection of objects where order does not matter
- 13. A vertex with no children in a rooted tree
- 18. A relation where aRb and bRa imply a equals b
- 20. A set containing exactly one element
- 21. A tree that includes every vertex of a connected graph
- 22. Sets having no common elements
- 23. A path or circuit that uses every edge exactly once
- 24. A graph that can be drawn without edge crossings
- 26. A collection of trees
- 27. A function in which different inputs have different outputs
Down
- 1. A function formed by applying one function after another
- 4. An arrangement of objects in a particular order
- 5. The set of possible outputs specified for a function
- 9. Sets having the same number of elements
- 11. Elements in the universal set that are not in a given set
- 12. A numerical value assigned to an edge
- 14. A relation where aRb and bRc imply aRc
- 15. An algorithm that selects edges in increasing order of weight
- 16. Elements common to two or more sets
- 17. A semigroup with an identity element
- 19. The product of two sets formed using ordered pairs
- 25. The designated starting node of a rooted tree