{"id":"https://openalex.org/W2064826930","doi":"https://doi.org/10.1007/s10623-013-9861-0","title":"Walk-regular divisible design graphs","display_name":"Walk-regular divisible design graphs","publication_year":2013,"publication_date":"2013-07-19","ids":{"openalex":"https://openalex.org/W2064826930","doi":"https://doi.org/10.1007/s10623-013-9861-0","mag":"2064826930"},"language":"en","primary_location":{"id":"doi:10.1007/s10623-013-9861-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10623-013-9861-0","pdf_url":null,"source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023779796","display_name":"Dean Crnkovi\u0107","orcid":"https://orcid.org/0000-0002-3299-7859"},"institutions":[{"id":"https://openalex.org/I154347574","display_name":"University of Rijeka","ror":"https://ror.org/05r8dqr10","country_code":"HR","type":"education","lineage":["https://openalex.org/I154347574"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Dean Crnkovi\u0107","raw_affiliation_strings":["Department of Mathematics, University of Rijeka, Rijeka, Croatia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Rijeka, Rijeka, Croatia","institution_ids":["https://openalex.org/I154347574"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027427715","display_name":"Willem H. Haemers","orcid":"https://orcid.org/0000-0001-7308-8355"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Willem H. Haemers","raw_affiliation_strings":["Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands","Department of Econometrics & Operations Research, Tilburg University, Tilburg, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]},{"raw_affiliation_string":"Department of Econometrics & Operations Research, Tilburg University, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027427715"],"corresponding_institution_ids":["https://openalex.org/I193700539"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":0.5329,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.6264095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"72","issue":"1","first_page":"165","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9966999888420105,"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"}},"topics":[{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9966999888420105,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9890000224113464,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6914011240005493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6859744787216187},{"id":"https://openalex.org/keywords/incidence-matrix","display_name":"Incidence matrix","score":0.645392119884491},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.6261734962463379},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5756627917289734},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5618882179260254},{"id":"https://openalex.org/keywords/strongly-regular-graph","display_name":"Strongly regular graph","score":0.5049715638160706},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49835968017578125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4361618161201477},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.32779690623283386},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15638187527656555},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09257689118385315},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.0679064691066742},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05387181043624878}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6914011240005493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6859744787216187},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.645392119884491},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.6261734962463379},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5756627917289734},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5618882179260254},{"id":"https://openalex.org/C133875400","wikidata":"https://www.wikidata.org/wiki/Q692823","display_name":"Strongly regular graph","level":5,"score":0.5049715638160706},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49835968017578125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4361618161201477},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.32779690623283386},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15638187527656555},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09257689118385315},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0679064691066742},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05387181043624878},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10623-013-9861-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10623-013-9861-0","pdf_url":null,"source":{"id":"https://openalex.org/S81616010","display_name":"Designs Codes and Cryptography","issn_l":"0925-1022","issn":["0925-1022","1573-7586"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Designs, Codes and Cryptography","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/2315bf6e-23ff-43d7-9ba9-e3453cf1ba9f","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/2315bf6e-23ff-43d7-9ba9-e3453cf1ba9f","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Crnkovic, D & Haemers, W H 2014, 'Walk regular divisible design graphs', Designs Codes and Cryptography, vol. 72, no. 1, pp. 165-175. https://doi.org/10.1007/s10623-013-9861-0","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2068730247","https://openalex.org/W2083617299","https://openalex.org/W2088115893","https://openalex.org/W2132589312","https://openalex.org/W2140565288","https://openalex.org/W2153988305"],"related_works":["https://openalex.org/W2358362677","https://openalex.org/W4281939267","https://openalex.org/W2353792840","https://openalex.org/W3092207479","https://openalex.org/W2022169596","https://openalex.org/W3022424798","https://openalex.org/W2383534452","https://openalex.org/W2368182133","https://openalex.org/W3201373007","https://openalex.org/W2064826930"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}