{"id":"https://openalex.org/W2070974525","doi":"https://doi.org/10.1080/00207160008804921","title":"On the neighbour-integrity of sequential joined graphs","display_name":"On the neighbour-integrity of sequential joined graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2070974525","doi":"https://doi.org/10.1080/00207160008804921","mag":"2070974525"},"language":"en","primary_location":{"id":"doi:10.1080/00207160008804921","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804921","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5013595822","display_name":"P\u0131nar Erbay D\u00fcndar","orcid":"https://orcid.org/0000-0002-9923-9657"},"institutions":[{"id":"https://openalex.org/I41641357","display_name":"Ege University","ror":"https://ror.org/02eaafc18","country_code":"TR","type":"education","lineage":["https://openalex.org/I41641357"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Pinar D\u00fcndar","raw_affiliation_strings":["Department of Math. and Compt. Science of Sciences Faculty , Univ. of Ege , Bornova-izmir, 35100, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Math. and Compt. Science of Sciences Faculty , Univ. of Ege , Bornova-izmir, 35100, Turkey","institution_ids":["https://openalex.org/I41641357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079813934","display_name":"Aysun Ozan","orcid":null},"institutions":[{"id":"https://openalex.org/I41641357","display_name":"Ege University","ror":"https://ror.org/02eaafc18","country_code":"TR","type":"education","lineage":["https://openalex.org/I41641357"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Aysun Ozan","raw_affiliation_strings":["Department of Math. and Compt. Science of Sciences Faculty , Univ. of Ege , Bornova-izmir, 35100, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Math. and Compt. Science of Sciences Faculty , Univ. of Ege , Bornova-izmir, 35100, Turkey","institution_ids":["https://openalex.org/I41641357"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013595822"],"corresponding_institution_ids":["https://openalex.org/I41641357"],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.73424276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"74","issue":"1","first_page":"45","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9990000128746033,"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/mathematics","display_name":"Mathematics","score":0.5083755850791931},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4479130506515503},{"id":"https://openalex.org/keywords/telecommunications-network","display_name":"Telecommunications network","score":0.4419352412223816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4260834753513336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4237945079803467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42122745513916016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3824732005596161},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37487608194351196},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10105928778648376}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5083755850791931},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4479130506515503},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.4419352412223816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4260834753513336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4237945079803467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42122745513916016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3824732005596161},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37487608194351196},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10105928778648376}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160008804921","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804921","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W128087099","https://openalex.org/W1591736593","https://openalex.org/W1975099798","https://openalex.org/W1976745318","https://openalex.org/W1993955016","https://openalex.org/W1999446839","https://openalex.org/W2002370532","https://openalex.org/W2015392054","https://openalex.org/W2156330532","https://openalex.org/W2751533025","https://openalex.org/W2753107708","https://openalex.org/W2796976177"],"related_works":["https://openalex.org/W3123242903","https://openalex.org/W2222736632","https://openalex.org/W4309875728","https://openalex.org/W2011542559","https://openalex.org/W2979057325","https://openalex.org/W1588601226","https://openalex.org/W4293212298","https://openalex.org/W3158053794","https://openalex.org/W2935978281","https://openalex.org/W30750922"],"abstract_inverted_index":{"In":[0,124,138],"a":[1,116],"communication":[2,23,76],"network,":[3],"the":[4,7,10,17,31,35,69,73,86,95,111,125,143,156],"vulnerability":[5],"measures":[6],"resistance":[8],"of":[9,14,19,37,75,91,115,121,146,161],"network":[11],"to":[12,53,71,109],"disruption":[13],"operation":[15],"after":[16,85],"failure":[18],"certain":[20],"stations":[21],"or":[22],"links.":[24],"We":[25,154],"consider":[26,142],"that":[27,59,130,150],"two":[28,46,96],"graphs":[29,149],"have":[30,65],"same":[32],"connectivity;":[33],"but":[34],"order":[36],"their":[38],"largest":[39],"components":[40],"are":[41],"not":[42],"equal.":[43],"Then,":[44],"these":[45,92],"graph":[47,62,87,117,122],"must":[48],"be":[49],"different":[50],"in":[51,68],"respect":[52],"stability.":[54],"How":[55,99,105],"can":[56,102],"we":[57,141],"measure":[58,120],"property?":[60],"Many":[61],"theoretical":[63],"parameters":[64,79],"been":[66],"used":[67],"past":[70],"describe":[72],"stability":[74],"networks.":[77],"New":[78],"take":[80],"into":[81],"account":[82],"what":[83],"remains":[84],"is":[88,107,118,128],"disconnected.":[89],"Several":[90],"deal":[93],"with":[94],"fundamental":[97],"questions.":[98],"many":[100],"vertices":[101],"still":[103],"communicate?":[104],"difficult":[106],"it":[108,127],"reconnect":[110],"graph?":[112],"The":[113],"neighbour-integrity":[114,144],"one":[119],"vulnerability.":[123],"neighbour-integrity,":[126],"considered":[129],"any":[131],"failured":[132],"vertex":[133],"effects":[134],"its":[135],"neighbour":[136],"vertices.":[137],"this":[139,159],"work,":[140],"number":[145],"sequential":[147],"joined":[148],"represent":[151],"communications":[152],"network.":[153],"give":[155],"theorems":[157],"on":[158],"classes":[160],"graphs.":[162]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}