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