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