{"id":"https://openalex.org/W2113124652","doi":"https://doi.org/10.1002/jgt.3190090407","title":"On graphs with prescribed median I","display_name":"On graphs with prescribed median I","publication_year":1985,"publication_date":"1985-12-01","ids":{"openalex":"https://openalex.org/W2113124652","doi":"https://doi.org/10.1002/jgt.3190090407","mag":"2113124652"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190090407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190090407","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"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":"Journal of Graph Theory","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/A5056897157","display_name":"George R. T. Hendry","orcid":null},"institutions":[{"id":"https://openalex.org/I195460627","display_name":"University of Aberdeen","ror":"https://ror.org/016476m91","country_code":"GB","type":"education","lineage":["https://openalex.org/I195460627"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"G. R. T. Hendry","raw_affiliation_strings":["Aberdeen University, Aberdeen, Scotland","Aberdeen University, Aberdeen, Scotland#TAB#"],"affiliations":[{"raw_affiliation_string":"Aberdeen University, Aberdeen, Scotland","institution_ids":["https://openalex.org/I195460627"]},{"raw_affiliation_string":"Aberdeen University, Aberdeen, Scotland#TAB#","institution_ids":["https://openalex.org/I195460627"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056897157"],"corresponding_institution_ids":["https://openalex.org/I195460627"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.5916,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.68945773,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"4","first_page":"477","last_page":"481"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9936000108718872,"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.9936000108718872,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9922999739646912,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9882000088691711,"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/combinatorics","display_name":"Combinatorics","score":0.8904182314872742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7880132794380188},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.6119161248207092},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5503388047218323},{"id":"https://openalex.org/keywords/bound-graph","display_name":"Bound graph","score":0.5495660305023193},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5312063097953796},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5083364844322205},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4873858094215393},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39459753036499023},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2204177975654602}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8904182314872742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7880132794380188},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.6119161248207092},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5503388047218323},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.5495660305023193},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5312063097953796},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5083364844322205},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4873858094215393},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39459753036499023},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2204177975654602}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190090407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190090407","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"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":"Journal of Graph Theory","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":3,"referenced_works":["https://openalex.org/W1989923224","https://openalex.org/W2008729281","https://openalex.org/W2019066354"],"related_works":["https://openalex.org/W1995383828","https://openalex.org/W4288436438","https://openalex.org/W4298388358","https://openalex.org/W2077631478","https://openalex.org/W4242930043","https://openalex.org/W1970462054","https://openalex.org/W2090130267","https://openalex.org/W2151291961","https://openalex.org/W2004791814","https://openalex.org/W2161439427"],"abstract_inverted_index":{"Abstract":[0],"The":[1,27],"distance":[2],"of":[3,15,25,30,35,41,55,103,119,126],"a":[4,8,56,104,110],"vertex":[5],"u":[6,20],"in":[7],"connected":[9,57],"graph":[10,46,58,111,122],"H":[11,31,36,59,112,127],"is":[12,32,65,96],"the":[13,17,22,33,39,52,101,120],"sum":[14],"all":[16],"distances":[18],"from":[19,109],"to":[21],"other":[23],"vertices":[24,40,72,102,125],"H.":[26],"median":[28,89,124],"M(H)":[29,61],"subgraph":[34],"induced":[37],"by":[38],"minimum":[42,53,74],"distance.":[43],"For":[44],"any":[45],"G":[47,69],",":[48,113],"let":[49],"f(G)":[50,78],"denote":[51],"order":[54],"satisfying":[60],"\u2245":[62],"G.":[63],"It":[64,95],"shown":[66,98],"that":[67,99],"if":[68,100],"has":[70],"n":[71,81],"and":[73,90],"degree":[75],"\u03b4":[76,83],"then":[77,114],"\u2a7d":[79],"2":[80],"\u2212":[82],"+":[84],"1.":[85],"Graphs":[86],"having":[87],"both":[88],"center":[91],"prescribed":[92],"are":[93,107],"constructed.":[94],"also":[97],"K":[105],"r":[106,117],"removed":[108],"at":[115],"most":[116],"components":[118],"resulting":[121],"contain":[123],".":[128]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}