Science Quiz / Graph Theory Definitions

Random Science or Math Quiz

Can you graph theory concept from the definition?

 Plays Quiz not verified by Sporcle

Support Sporcle.
Go Orange.
Score 0/32 Timer 10:00
DefinitionConcept
A map from a graph's vertices to a finite set in which no two adjacent vertices are mapped to the same element.
A graph is this if every vertex has the same degree.
The number of edges incident on a given vertex.
A graph is this if every pair of vertices has a path between them.
This quantity is the length of the shortest path between a pair of vertices.
The graph formed of a given graph with the same vertices but features any edges the original does not, and vice versa.
A graph is this if every cycle of length 4 or more has a chord.
An edge that connects two non-consecutive vertices in a cycle.
This quantity is the number of vertices in a graph's largest independent set.
An acyclic graph.
A subset of a connected graph's vertices which, when removed, causes the graph to be disconnected.
A subset of a graph's vertices in which every edge of the graph is incident on a vertex of the subset.
A sequence of distinct vertices such that consecutive vertices are adjacent.
A vertex with only one edge.
A graph is this if it can be partitioned into a clique and an independent set.
A set of vertices in which every vertex is adjacent to every other vertex.
DefinitionConcept
A vertex is this if its neighbourhood is a clique.
A path whose first and last vertex are the same.
A set of vertices in which no vertex is adjacent to any other vertex.
This quantity is the longest distance between any two vertices in a graph.
An acyclic connected graph.
A graph is this if it can be drawn with no two edges crossing over each other.
This quantity is the minimum of a graph's clique number and its independence number.
This quantity is the minimum number of vertices a graph must have to guarantee a clique and independent set of a given size.
A region of a planar graph enclosed by edges.
A graph is this if its vertices can be partitioned into two independent sets.
A graph is this if its chromatic number equals its clique number.
A subset of a graph's edges in which no two edges share a vertex.
This quantity is the minimum number of colours required to colour a given graph.
Set of vertices adjacent to a given vertex.
A graph obtained from another graph by contracting edges, or deleting edges or vertices.
This quantity is the number of vertices in a graph's largest clique.

You're not logged in!

Compare scores with friends on all Sporcle quizzes.
OR
Log In
Forgot?

From the Vault

Chemical Nomenclature - Ionic Compounds

by RyanWitchey

If we've said it once, we've said it a hundred times, Ionic Compounds are *so* selfish.
Remove Ads.
Support Sporcle.
Get the best of Sporcle when you Go Orange. This ad-free experience offers more features, more stats, and more fun while also helping to support Sporcle. Thank you for becoming a member.

Show Comments

Extras

Created Dec 13, 2019ReportNominate
Tags:Math Quiz, graph, mathematics

Top Quizzes Today


Score Distribution

Your Account Isn't Verified!

In order to create a playlist on Sporcle, you need to verify the email address you used during registration. Go to your Sporcle Settings to finish the process.

Report this User

Report this user for behavior that violates our Community Guidelines.

Details: