{"id":"https://openalex.org/W4399211567","doi":"https://doi.org/10.3233/fi-242174","title":"Closeness and Vertex Residual Closeness of Harary Graphs","display_name":"Closeness and Vertex Residual Closeness of Harary Graphs","publication_year":2024,"publication_date":"2024-05-31","ids":{"openalex":"https://openalex.org/W4399211567","doi":"https://doi.org/10.3233/fi-242174"},"language":"en","primary_location":{"id":"doi:10.3233/fi-242174","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-242174","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5010892820","display_name":"Hande Tun\u00e7el G\u00f6lpek","orcid":"https://orcid.org/0000-0001-9183-6732"},"institutions":[{"id":"https://openalex.org/I193615760","display_name":"Dokuz Eyl\u00fcl University","ror":"https://ror.org/00dbd8b73","country_code":"TR","type":"education","lineage":["https://openalex.org/I193615760"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Hande Tuncel Golpek","raw_affiliation_strings":["Maritime Faculty, Dokuz Eylul University, Tinaztepe Campus, Buca, Izmir, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maritime Faculty, Dokuz Eylul University, Tinaztepe Campus, Buca, Izmir, Turkey","institution_ids":["https://openalex.org/I193615760"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034630468","display_name":"Aysun Ayta\u00e7","orcid":"https://orcid.org/0000-0003-2086-8969"},"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 Aytac","raw_affiliation_strings":["Department of Mathematics, Ege University, Bornova, Izmir, Turkey","Journal:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Ege University, Bornova, Izmir, Turkey","institution_ids":["https://openalex.org/I41641357"]},{"raw_affiliation_string":"Journal:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010892820"],"corresponding_institution_ids":["https://openalex.org/I193615760"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13724471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"191","issue":"2","first_page":"105","last_page":"127"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9984999895095825,"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.9984999895095825,"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.9021000266075134,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/closeness","display_name":"Closeness","score":0.9184036254882812},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7329936623573303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.569119393825531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5527931451797485},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.4866350591182709},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4579209089279175},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4430388808250427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4322681725025177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3862783908843994},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1966848075389862}],"concepts":[{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.9184036254882812},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7329936623573303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.569119393825531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5527931451797485},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.4866350591182709},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4579209089279175},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4430388808250427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4322681725025177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3862783908843994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1966848075389862},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-242174","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-242174","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2156910174","https://openalex.org/W1995054232","https://openalex.org/W2011510925","https://openalex.org/W1557920161","https://openalex.org/W1556709767","https://openalex.org/W1993023208","https://openalex.org/W4291020658","https://openalex.org/W2593813644","https://openalex.org/W2061476331","https://openalex.org/W4300237897"],"abstract_inverted_index":{"Analysis":[0],"of":[1,6,10,48,63,108,142],"a":[2,19,81,96],"network":[3,25],"in":[4,116],"terms":[5],"vulnerability":[7,53,99],"is":[8,80],"one":[9,47],"the":[11,35,41,49,61,73,106,109,138],"most":[12,50],"significant":[13],"problems.":[14],"Graph":[15],"theory":[16],"serves":[17],"as":[18,46,95],"valuable":[20],"tool":[21],"for":[22],"solving":[23],"complex":[24],"problems,":[26],"and":[27,65,83,111],"there":[28],"exist":[29],"numerous":[30],"graph-theoretic":[31],"parameters":[32,115],"to":[33,59,67,88],"analyze":[34],"system\u2019s":[36],"stability.":[37],"Among":[38],"these":[39],"parameters,":[40,91],"closeness":[42,74,110,114],"parameter":[43,86],"stands":[44],"out":[45],"commonly":[51],"used":[52],"metrics.":[54],"Its":[55],"definition":[56],"has":[57,92],"evolved":[58],"enhance":[60],"ease":[62],"formulation":[64],"applicability":[66],"disconnected":[68],"structures.":[69],"Furthermore,":[70],"based":[71],"on":[72],"parameter,":[75],"vertex":[76,112],"residual":[77,113],"closeness,":[78],"which":[79],"newer":[82],"more":[84],"sensitive":[85],"compared":[87],"other":[89],"existing":[90],"been":[93,120],"introduced":[94],"new":[97],"graph":[98],"index":[100],"by":[101,130],"Dangalchev.":[102],"In":[103],"this":[104],"study,":[105],"outcomes":[107],"Harary":[117,122],"Graphs":[118,123],"have":[119],"examined.":[121],"are":[124,128,135],"well-known":[125],"constructs":[126],"that":[127,134],"distinguished":[129],"having":[131],"n":[132],"vertices":[133],"k-connected":[136],"with":[137],"least":[139],"possible":[140],"number":[141],"edges.":[143]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}