{"id":"https://openalex.org/W2060631499","doi":"https://doi.org/10.1002/net.3230190704","title":"On designing a network to defend against random attacks of radius two","display_name":"On designing a network to defend against random attacks of radius two","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W2060631499","doi":"https://doi.org/10.1002/net.3230190704","mag":"2060631499"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230190704","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230190704","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5015600951","display_name":"Arthur S. Finbow","orcid":"https://orcid.org/0000-0003-2105-2515"},"institutions":[{"id":"https://openalex.org/I66890659","display_name":"Saint Mary's University","ror":"https://ror.org/010zh7098","country_code":"CA","type":"education","lineage":["https://openalex.org/I66890659"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A. S. Finbow","raw_affiliation_strings":["Saint Mary's University Halifax, Nova Scotia, Canada B3H 3C3"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saint Mary's University Halifax, Nova Scotia, Canada B3H 3C3","institution_ids":["https://openalex.org/I66890659"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052665260","display_name":"Bert L. Hartnell","orcid":null},"institutions":[{"id":"https://openalex.org/I66890659","display_name":"Saint Mary's University","ror":"https://ror.org/010zh7098","country_code":"CA","type":"education","lineage":["https://openalex.org/I66890659"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"B. L. Hartnell","raw_affiliation_strings":["Saint Mary's University Halifax, Nova Scotia, Canada B3H 3C3"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saint Mary's University Halifax, Nova Scotia, Canada B3H 3C3","institution_ids":["https://openalex.org/I66890659"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.20750426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"19","issue":"7","first_page":"771","last_page":"792"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7701301574707031},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.71455979347229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.571111261844635},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5550664067268372},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5125279426574707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4869624078273773},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4758607745170593},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4314318895339966},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38346046209335327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37469303607940674},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10468828678131104}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7701301574707031},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.71455979347229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.571111261844635},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5550664067268372},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5125279426574707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4869624078273773},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4758607745170593},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4314318895339966},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38346046209335327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37469303607940674},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10468828678131104},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230190704","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230190704","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2159904535","https://openalex.org/W2171985270"],"related_works":["https://openalex.org/W1977638783","https://openalex.org/W2089226528","https://openalex.org/W2290279467","https://openalex.org/W2950600109","https://openalex.org/W4300192106","https://openalex.org/W2634205767","https://openalex.org/W2144784192","https://openalex.org/W2083795876","https://openalex.org/W4310998877","https://openalex.org/W2361081252"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"considers":[3],"the":[4,8,55,59,78],"following":[5],"variation":[6],"on":[7,45,108],"construction":[9],"of":[10,42,54,62,77,82,104],"a":[11,16,36,51],"reliable":[12],"communication":[13],"network.":[14],"Whenever":[15],"vertex":[17],"is":[18,70,73,84,93,99],"attacked,":[19],"all":[20,40,96],"vertices":[21,47,56,63,83],"within":[22],"distance":[23],"2":[24,79],"are":[25,32,57,65],"also":[26],"destroyed":[27,66],"(or":[28],"fail)":[29],"indirectly.":[30],"We":[31],"interested":[33],"in":[34],"designing":[35],"connected":[37],"graph":[38],"(undirected,":[39],"edges":[41],"length":[43],"one)":[44],"p":[46,80,97,111],"such":[48],"that":[49,64,75],"when":[50],"random":[52],"subset":[53],"attacked":[58],"expected":[60],"number":[61],"(directly":[67],"and":[68,98],"indirectly)":[69],"minimized.":[71],"It":[72],"assumed":[74],"any":[76],"subsets":[81],"equally":[85],"likely":[86],"to":[87,101],"be":[88,102],"attacked.":[89],"The":[90],"optimal":[91],"structure":[92],"determined":[94],"for":[95],"shown":[100],"one":[103],"five":[105],"patterns":[106],"depending":[107],"r":[109],"where":[110],"=":[112],"5t":[113],"+":[114],"r.":[115]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}