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