{"id":"https://openalex.org/W2108595221","doi":"https://doi.org/10.37236/128","title":"Fixing Numbers of Graphs and Groups","display_name":"Fixing Numbers of Graphs and Groups","publication_year":2009,"publication_date":"2009-03-20","ids":{"openalex":"https://openalex.org/W2108595221","doi":"https://doi.org/10.37236/128","mag":"2108595221"},"language":"en","primary_location":{"id":"doi:10.37236/128","is_oa":true,"landing_page_url":"https://doi.org/10.37236/128","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r39/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r39/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018476896","display_name":"Courtney R. Gibbons","orcid":"https://orcid.org/0000-0002-9016-7597"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Courtney R. Gibbons","raw_affiliation_strings":["University of Nebraska -Lincoln Department of Mathematics 228 Avery Hall PO Box 880130 Lincoln, NE 68588-0130","#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#"],"affiliations":[{"raw_affiliation_string":"University of Nebraska -Lincoln Department of Mathematics 228 Avery Hall PO Box 880130 Lincoln, NE 68588-0130","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021069342","display_name":"Joshua D. Laison","orcid":null},"institutions":[{"id":"https://openalex.org/I141670070","display_name":"Willamette University","ror":"https://ror.org/04g9e0f44","country_code":"US","type":"education","lineage":["https://openalex.org/I141670070"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua D. Laison","raw_affiliation_strings":["Mathematics Department Willamette University 900 State St. Salem, OR 97301","Willamette University#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics Department Willamette University 900 State St. Salem, OR 97301","institution_ids":["https://openalex.org/I141670070"]},{"raw_affiliation_string":"Willamette University#TAB#","institution_ids":["https://openalex.org/I141670070"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018476896"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":2.3995,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.88801706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9998000264167786,"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.9771999716758728,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9524999856948853,"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/mathematics","display_name":"Mathematics","score":0.8631328344345093},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8472868800163269},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.583402693271637},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.5831426382064819},{"id":"https://openalex.org/keywords/graph-automorphism","display_name":"Graph automorphism","score":0.46316608786582947},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45358848571777344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4511139690876007},{"id":"https://openalex.org/keywords/automorphism-group","display_name":"Automorphism group","score":0.4438527822494507},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.4108901619911194},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.41063442826271057},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1486312448978424},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1263006031513214}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8631328344345093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8472868800163269},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.583402693271637},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.5831426382064819},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.46316608786582947},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45358848571777344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4511139690876007},{"id":"https://openalex.org/C2988750069","wikidata":"https://www.wikidata.org/wiki/Q60790315","display_name":"Automorphism group","level":3,"score":0.4438527822494507},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.4108901619911194},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.41063442826271057},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1486312448978424},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1263006031513214}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/128","is_oa":true,"landing_page_url":"https://doi.org/10.37236/128","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r39/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/128","is_oa":true,"landing_page_url":"https://doi.org/10.37236/128","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v16i1r39/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2108595221.pdf","grobid_xml":"https://content.openalex.org/works/W2108595221.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W247697463","https://openalex.org/W1516924510","https://openalex.org/W1560095312","https://openalex.org/W1855706715","https://openalex.org/W2024374611","https://openalex.org/W2071985039","https://openalex.org/W2078462949","https://openalex.org/W2114492759","https://openalex.org/W2119754212","https://openalex.org/W2121634574","https://openalex.org/W2169476811","https://openalex.org/W2327861675","https://openalex.org/W2798943694","https://openalex.org/W4238591275"],"related_works":["https://openalex.org/W4302155387","https://openalex.org/W2949256963","https://openalex.org/W2545189445","https://openalex.org/W2115024785","https://openalex.org/W2949890955","https://openalex.org/W2085781584","https://openalex.org/W4289596368","https://openalex.org/W1543499813","https://openalex.org/W1678473343","https://openalex.org/W2390866431"],"abstract_inverted_index":{"The":[0,30,81],"fixing":[1,31,42,82,114,123],"number":[2,57,63,83,94],"of":[3,11,14,23,33,40,44,58,64,75,87,91,116,125],"a":[4,12,34,59,89],"graph":[5,78],"$G$":[6,24,69],"is":[7,37,79],"the":[8,20,38,55,61,72,76,92,113,122],"smallest":[9,62],"cardinality":[10],"set":[13,32,39],"vertices":[15],"$S$":[16],"such":[17],"that":[18,71],"only":[19,102],"trivial":[21],"automorphism":[22,48,73],"fixes":[25],"every":[26,97,106],"vertex":[27,107],"in":[28,95],"$S$.":[29],"group":[35,49,74],"$\\Gamma$":[36],"all":[41],"numbers":[43],"finite":[45,117],"graphs":[46],"with":[47],"$\\Gamma$.":[50],"Several":[51],"authors":[52],"have":[53],"studied":[54],"distinguishing":[56,93],"graph,":[60],"labels":[65],"needed":[66],"to":[67],"label":[68,98],"so":[70],"labeled":[77],"trivial.":[80],"can":[84],"be":[85,100,109],"thought":[86],"as":[88],"variation":[90],"which":[96],"may":[99],"used":[101],"once,":[103],"and":[104,120],"not":[105],"need":[108],"labeled.":[110],"We":[111],"characterize":[112],"sets":[115,124],"abelian":[118],"groups,":[119],"investigate":[121],"symmetric":[126],"groups.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}