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: Introduction to Graph Theory | Statement: [Richard J. Wilson, notableWork, Introduction to Graph Theory]

Target entity: Introduction to Graph Theory
Context triple: [Richard J. Wilson, notableWork, Introduction to Graph Theory]

• A. Graph Algorithms (book)
  "Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
• B. Erdős on Graphs: His Legacy
  Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
• C. 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.
• D. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• E. Spectral Graph Theory
  Spectral Graph Theory is a mathematical field that studies graphs through the eigenvalues and eigenvectors of matrices associated with them, such as adjacency and Laplacian matrices, with applications across combinatorics, computer science, and network analysis.
• 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: Introduction to Graph Theory
Triple: [Richard J. Wilson, notableWork, Introduction to Graph Theory]

Introduction to Graph Theory is a widely used textbook that provides a clear and accessible introduction to the fundamental concepts and techniques of graph theory.

Target entity: Introduction to Graph Theory
Target entity description: Introduction to Graph Theory is a widely used textbook that provides a clear and accessible introduction to the fundamental concepts and techniques of graph theory.

• A. Graph Algorithms (book)
  "Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
• B. Erdős on Graphs: His Legacy
  Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
• C. 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.
• D. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• E. Spectral Graph Theory
  Spectral Graph Theory is a mathematical field that studies graphs through the eigenvalues and eigenvectors of matrices associated with them, such as adjacency and Laplacian matrices, with applications across combinatorics, computer science, and network analysis.
• F. None of above. chosen