A) A line graph B) A chart or diagram C) A pie chart D) A mathematical structure consisting of vertices and edges
A) A path between two vertices B) A point or node in a graph C) A function in graph theory D) A line connecting two points in a graph
A) A node's color in a graph B) A vertex with no connections C) A loop on a vertex D) A connection between two vertices
A) A cycle in a graph B) A sequence of edges that connect a sequence of vertices C) A disconnected graph D) An isolated vertex
A) Yes B) Depends on the number of vertices C) Sometimes D) No
A) The distance from one vertex to another B) The size of the graph C) The number of edges incident to the vertex D) The number of vertices in the graph
A) A multigraph B) A graph that can be drawn on a plane without any edge intersections C) A disconnected graph D) A graph with cycles
A) A graph in which a number (weight) is assigned to each edge B) A graph with maximum number of edges C) A graph with only one vertex D) An undirected graph
A) Two disconnected graphs B) A loop on a vertex in both graphs C) The same number of vertices in both graphs D) A bijection between their vertex sets that preserves edges
A) The Seven Bridges of Königsberg B) Graph Theory and its Applications C) On the Nature of Graphs D) Solutio Problematis ad Geometriam Situs Pertinentis
A) Directed graph B) Multigraph C) Simple graph D) Undirected graph
A) Dénes Kőnig B) James Joseph Sylvester C) Arthur Cayley D) Leonhard Euler
A) Four-color problem B) Seven Bridges problem C) Graph connectivity problem D) Knight's tour problem
A) Peter Tait B) William Rowan Hamilton C) Francis Guthrie D) Augustus De Morgan
A) Heinrich Heesch B) Frank Harary C) Arthur Cayley D) Dénes Kőnig
A) Dénes Kőnig B) Arthur Cayley C) Frank Harary D) Leonhard Euler
A) Gustav Kirchhoff B) Arthur Cayley C) Leonhard Euler D) Dénes Kőnig
A) Discharging method B) Configuration checking C) Graph reduction D) Coloring algorithm
A) W. T. Tutte. B) Euler. C) Dijkstra. D) Floyd.
A) Mantel B) Erdős C) Rényi D) Szemerédi
A) Adjacency matrix B) Incidence matrix C) Adjacency list D) Edge list
A) Edge coloring B) Graph factorization C) Arboricity D) Cycle double cover
A) Habitat destruction B) Evolutionary trees C) Genetic mutations D) Species extinction events
A) A method for finding spanning trees. B) A model for generating random graphs. C) An algorithm for graph coloring. D) A technique for partitioning graphs.
A) Molecules B) Bonds C) Chemical reactions D) Atoms
A) Dependent on the weights assigned to edges. B) Zero. C) One. D) Equal to the number of vertices.
A) Leonhard Euler B) Frank Harary C) Arthur Cayley D) Dénes Kőnig
A) Head-driven phrase structure grammar B) Graph databases C) Semantic networks D) Optimality theory
A) Euler's theorem B) Paley's theorem C) Sylow's theorem D) Frucht's theorem
A) Nicolaas Govert de Bruijn B) Arthur Cayley C) Heinrich Heesch D) Frank Harary
A) Fluid flow paths B) Pores themselves C) Solid structures D) Smaller channels connecting the pores
A) Cycle double cover B) Edge coloring C) Arboricity D) Graph factorization
A) Knight's tour problem B) Graph connectivity problem C) Generalized four-color problem D) Graph factorization problem
A) Lattice graphs B) Finite-state transducers C) Directed graphs D) Tree-based structures
A) Semantic network B) Causal structure C) Network D) Graph database
A) Adjacency matrix B) Matrix structures C) Incidence matrix D) List structures
A) Channels B) Solids C) Pores D) Fluids
A) Hamiltonian path problem B) Steiner tree C) Traveling salesman problem D) Minimum spanning tree
A) Bonds B) Chemical reactions C) Molecules D) Atoms
A) Hamiltonian path problem B) Traveling salesman problem C) Minimum spanning tree D) Steiner tree
A) TextGraphs B) Finite-state transducers C) WordNet D) VerbNet
A) Physics B) Biology C) Linguistics D) Computer science
A) Lattice graphs B) Graph databases C) Syntactic trees D) Semantic networks
A) Optimality theory B) Feature structures C) Compositionality D) Finite-state transducers
A) Group theory B) Combinatorics C) Number theory D) Linear algebra
A) Incidence matrix B) Degree matrix C) Adjacency matrix D) Laplacian matrix
A) Hungarian mathematician Pál Turán. B) László Lovász. C) Karl Menger. D) Paul Erdős. |