Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Eulerian digraph | Statement: [de Bruijn–van Aardenne–Ehrenfest theorem, concernsProperty, Eulerian digraph]

Target entity: Eulerian digraph
Context triple: [de Bruijn–van Aardenne–Ehrenfest theorem, concernsProperty, Eulerian digraph]

• A. Eulerian trail
  An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
• B. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• C. DAG
  DAG is the National Rail station code for Dalgety Bay railway station in Fife, Scotland.
• D. Euler’s theorem
  Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
• E. Menger theorem in graph theory
  Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Eulerian digraph
Triple: [de Bruijn–van Aardenne–Ehrenfest theorem, concernsProperty, Eulerian digraph]

An Eulerian digraph is a directed graph in which every vertex has equal in-degree and out-degree, allowing for a closed trail that traverses each edge exactly once.

Target entity: Eulerian digraph
Target entity description: An Eulerian digraph is a directed graph in which every vertex has equal in-degree and out-degree, allowing for a closed trail that traverses each edge exactly once.

• A. Eulerian trail
  An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
• B. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• C. DAG
  DAG is the National Rail station code for Dalgety Bay railway station in Fife, Scotland.
• D. Euler’s theorem
  Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
• E. Menger theorem in graph theory
  Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
• F. None of above. chosen