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