{"id":"https://openalex.org/keywords/isomorphic-graphs","display_name":"isomorphic graphs","description":"Isomorphic graphs are graphs whose vertices can be paired bijectively so that adjacency relationships are preserved, making their structures equivalent.","display_name_alternatives":["isomorphic graph"],"ids":{"openalex":"https://openalex.org/keywords/isomorphic-graphs","wikidata":"https://www.wikidata.org/wiki/Q303100"},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1356,"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/T11476","display_name":"Graph theory and applications","score":0.108,"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"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.0905,"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":128,"cited_by_count":955,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/isomorphic-graphs","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
