Graphs and Applications
E895620
Graphs and Applications is a well-known textbook by Richard J. Wilson that introduces graph theory and demonstrates its use in solving practical problems across science, engineering, and computer science.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Graphs and Applications canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10945746 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Graphs and Applications Context triple: [Richard J. Wilson, notableWork, Graphs and Applications]
-
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.
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.
-
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.
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Graphs and Applications Target entity description: Graphs and Applications is a well-known textbook by Richard J. Wilson that introduces graph theory and demonstrates its use in solving practical problems across science, engineering, and computer science.
-
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.
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.
-
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.
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
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
mathematics textbook ⓘ textbook ⓘ |
| appliesTo |
communication networks
ⓘ
computer algorithms ⓘ electrical networks ⓘ operations research ⓘ social networks ⓘ transportation networks ⓘ |
| coversTopic |
Eulerian graphs
NERFINISHED
ⓘ
Hamiltonian graphs ⓘ connectivity in graphs ⓘ cycles in graphs ⓘ graph coloring ⓘ graphs ⓘ matching and factors ⓘ network flows ⓘ paths in graphs ⓘ planar graphs ⓘ trees ⓘ |
| demonstrates | use of graphs in modeling real-world problems ⓘ |
| emphasizes |
practical problem solving
ⓘ
real-world examples ⓘ |
| field |
computer science
ⓘ
engineering ⓘ mathematics ⓘ |
| focusesOn | applications of graph theory ⓘ |
| hasAuthor | Richard J. Wilson NERFINISHED ⓘ |
| hasReputation |
standard introduction to applied graph theory
ⓘ
well-known textbook in graph theory ⓘ |
| hasSubject |
combinatorics
ⓘ
discrete mathematics ⓘ graph theory ⓘ |
| intendedFor |
graduate students
ⓘ
researchers in applied mathematics ⓘ undergraduate students ⓘ |
| isUsedAs |
course reference
ⓘ
university textbook ⓘ |
| isUsedIn |
computer science education
ⓘ
engineering education ⓘ science education ⓘ |
| language | English ⓘ |
| usedAt | universities worldwide ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Graphs and Applications Description of subject: Graphs and Applications is a well-known textbook by Richard J. Wilson that introduces graph theory and demonstrates its use in solving practical problems across science, engineering, and computer science.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.