{"id":"https://openalex.org/keywords/graph-diameter","display_name":"graph diameter","description":"The greatest shortest-path distance between any pair of vertices in a graph, a measure studied in graph theory and network analysis.","display_name_alternatives":["diam(G)","diameter of graphs","diameter of a graph","diameter of a network"],"ids":{"openalex":"https://openalex.org/keywords/graph-diameter","wikidata":"https://www.wikidata.org/wiki/Q16628701"},"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.2007,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.2007,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1998,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1288,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.0733,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":4929,"cited_by_count":54846,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/graph-diameter","updated_date":"2026-10-22T04:07:25","created_date":"2026-09-30T00:00:00"}