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