{"id":"https://openalex.org/W2009321501","doi":"https://doi.org/10.1137/080724277","title":"Pebbling Algorithms in Diameter Two Graphs","display_name":"Pebbling Algorithms in Diameter Two Graphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2009321501","doi":"https://doi.org/10.1137/080724277","mag":"2009321501"},"language":"en","primary_location":{"id":"doi:10.1137/080724277","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080724277","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete 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/A5018641089","display_name":"Airat Bekmetjev","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Airat Bekmetjev","raw_affiliation_strings":["bekmetjev@hope.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"bekmetjev@hope.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016956491","display_name":"Charles A. Cusack","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Charles A. Cusack","raw_affiliation_strings":["cusack@hope.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"cusack@hope.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018641089"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0567,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86105746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"2","first_page":"634","last_page":"646"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.995199978351593,"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.8574435710906982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7491612434387207},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.654768168926239},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48861104249954224},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4116882085800171}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8574435710906982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7491612434387207},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.654768168926239},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48861104249954224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4116882085800171}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080724277","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080724277","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete 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":6,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1976285925","https://openalex.org/W2003959728","https://openalex.org/W2033611584","https://openalex.org/W2111332454","https://openalex.org/W2741999158"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Consider":[0],"a":[1,5,21,41,48,84,102,108],"connected":[2],"graph":[3,105],"and":[4,23,146],"configuration":[6,31,60,86,109],"of":[7,16,50,71,83,89,101,144,151],"pebbles":[8,19,63],"on":[9,26,43,87],"its":[10],"vertices.":[11],"A":[12,30,53],"pebbling":[13,51,69,85,163],"step":[14],"consists":[15],"removing":[17],"two":[18,104,122,160],"from":[20],"vertex":[22,46,99],"placing":[24],"one":[25],"an":[27,132,156],"adjacent":[28],"vertex.":[29],"is":[32,37,64,66,97,110,141,148],"called":[33,67],"solvable":[34,65,111],"if":[35,95,112],"it":[36],"possible":[38],"to":[39,130],"place":[40],"pebble":[42],"any":[44,59],"given":[45],"through":[47],"sequence":[49],"steps.":[52],"smallest":[54],"number":[55,70,143,150,164],"t":[56,62],"such":[57],"that":[58,94,134],"with":[61,121,162],"the":[68,72,81,98,142,149],"graph.":[73],"In":[74],"this":[75,128],"paper,":[76],"we":[77],"consider":[78],"algorithms":[79],"determining":[80],"solvability":[82],"graphs":[88,161],"diameter":[90,103,159],"two.":[91],"We":[92,126,153],"prove":[93],"k":[96],"connectivity":[100],"G,":[106],"then":[107],"there":[113],"are":[114],"at":[115],"least":[116],"$c(k)=\\min\\{k+4,3k-1\\}$":[117],"vertices":[118,145],"in":[119],"G":[120],"or":[123],"more":[124],"pebbles.":[125],"use":[127],"result":[129],"construct":[131],"algorithm":[133,157],"has":[135],"complexity":[136],"$O(c(k)!\\cdot":[137],"n^{2c(k)-3}m)$,":[138],"where":[139],"n":[140],"m":[147],"edges.":[152],"also":[154],"present":[155],"for":[158],"$n+1$,":[165],"known":[166],"as":[167],"Class":[168],"1":[169],"graphs,":[170],"which":[171],"takes":[172],"$O(nm)$":[173],"time.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}