Exact values for three domination-like problems in circular and infinite grid graphs of small height
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for...
Uloženo v:
| Vydáno v: | Discrete Mathematics and Theoretical Computer Science Ročník 21 no. 3; číslo Graph Theory; s. COV2 - 21 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Nancy
DMTCS
01.07.2019
Discrete Mathematics & Theoretical Computer Science |
| Témata: | |
| ISSN: | 1365-8050, 1462-7264, 1365-8050 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs. |
|---|---|
| AbstractList | In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs. In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs. Keywords: graph algorithm, identifying code, locating-dominating code, locating-total-dominating code, grid |
| Audience | Academic |
| Author | Preissmann, Myriam Moncel, Julien Darlay, Julien Bouznif, Marwane |
| Author_xml | – sequence: 1 givenname: Marwane orcidid: 0000-0002-5138-1582 surname: Bouznif fullname: Bouznif, Marwane – sequence: 2 givenname: Julien surname: Darlay fullname: Darlay, Julien – sequence: 3 givenname: Julien surname: Moncel fullname: Moncel, Julien – sequence: 4 givenname: Myriam orcidid: 0000-0002-3484-6755 surname: Preissmann fullname: Preissmann, Myriam |
| BackLink | https://hal.science/hal-01569881$$DView record in HAL |
| BookMark | eNptkktv1DAUhSNUJNrClrUlVixS_Ezs5WgotNIgFpS1dWtfTzwk8WBnqvLvMTOIh1RZ8uPo89H18b1ozuY0Y9O8ZvSKi07od-8_3a2_tJy1omX8WXPORKdaTRU9-2f_orkoZUcp40b2542_fgS3kAcYD1hISJksQ0YkPk1xhiWmuR3jNyT7nO5HnAqJM3Exu8MImcDs6znEOS5Itjn6OsF-KCQFUiYYRzJg3A7Ly-Z5gLHgq9_rZfP1w_Xd-qbdfP54u15tWie5WVrgQkvhVO8dR_TouJRItWKSsl5iZ5gw9z03ugetA-XShCBcUIoCcBOouGxuT74-wc7uc5wg_7AJoj0KKW8t5CW6ES0YITEgKtOB1F2vqfSedV5xVv0NVq-3J68Bxv-sblYb-0ujTHVGa_YgKvvmxNaUvtccF7tLhzzXp1pBpdGCsV79pbZQC6i5pSWDm2JxdtXxvueycpW6eoKqw-MUXf3xEKv-1AWXUykZw59qGbXHxrDHxrCcWWEZFz8B4Hup1g |
| ContentType | Journal Article |
| Copyright | COPYRIGHT 2019 DMTCS Copyright DMTCS 2019 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: COPYRIGHT 2019 DMTCS – notice: Copyright DMTCS 2019 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BFMQW BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS 1XC VOOES DOA |
| DOI | 10.23638/DMTCS-21-3-12 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central Continental Europe Database Technology collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection Continental Europe Database ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1365-8050 |
| EndPage | 21 |
| ExternalDocumentID | oai_doaj_org_article_a934efee596a4867804dd16d5219879e oai:HAL:hal-01569881v3 A627724311 10_23638_DMTCS_21_3_12 |
| GeographicLocations | France |
| GeographicLocations_xml | – name: France |
| GroupedDBID | -~9 .4S .DC 29G 2WC 5GY 5VS 8FE 8FG AAFWJ AAYXX ABDBF ABJCF ABUWG ACGFO ACIWK ACUHS ADBBV ADQAK AENEX AFFHD AFKRA AFPKN AIAGR ALMA_UNASSIGNED_HOLDINGS AMVHM ARCSS B0M BAIFH BBTPI BCNDV BENPR BFMQW BGLVJ BPHCQ CCPQU CITATION EAP EBS ECS EDO EJD EMK EPL EST ESX GROUPED_DOAJ HCIFZ I-F IAO IBB ICD ITC J9A KQ8 KWQ L6V M7S MK~ ML~ OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PV9 REM RNS RSU RZL TR2 TUS XSB ~8M M~E ADOJU AZQEC DWQXO PKEHL PQEST PQUKI PRINS 1XC VOOES |
| ID | FETCH-LOGICAL-c429t-a23843c57dc2eedec244e085140174e69139b72987a88f0249ff3cf550aa29f03 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000480436900022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1365-8050 1462-7264 |
| IngestDate | Fri Oct 03 12:51:07 EDT 2025 Sat Oct 25 06:44:48 EDT 2025 Fri Jul 25 12:04:02 EDT 2025 Wed Mar 19 01:48:23 EDT 2025 Sat Mar 08 18:09:32 EST 2025 Sat Nov 29 08:07:10 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Graph Theory |
| Keywords | locating-dominating code locating-total-dominating code identifying code graph algorithm grid |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c429t-a23843c57dc2eedec244e085140174e69139b72987a88f0249ff3cf550aa29f03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-5138-1582 0000-0002-3484-6755 |
| OpenAccessLink | https://doaj.org/article/a934efee596a4867804dd16d5219879e |
| PQID | 3049831175 |
| PQPubID | 946337 |
| PageCount | 21 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_a934efee596a4867804dd16d5219879e hal_primary_oai_HAL_hal_01569881v3 proquest_journals_3049831175 gale_infotracmisc_A627724311 gale_infotracacademiconefile_A627724311 crossref_primary_10_23638_DMTCS_21_3_12 |
| PublicationCentury | 2000 |
| PublicationDate | 20190701 |
| PublicationDateYYYYMMDD | 2019-07-01 |
| PublicationDate_xml | – month: 07 year: 2019 text: 20190701 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Nancy |
| PublicationPlace_xml | – name: Nancy |
| PublicationTitle | Discrete Mathematics and Theoretical Computer Science |
| PublicationYear | 2019 |
| Publisher | DMTCS Discrete Mathematics & Theoretical Computer Science |
| Publisher_xml | – name: DMTCS – name: Discrete Mathematics & Theoretical Computer Science |
| SSID | ssj0012947 ssib044734695 |
| Score | 2.1511106 |
| Snippet | In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are... |
| SourceID | doaj hal proquest gale crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database |
| StartPage | COV2 |
| SubjectTerms | [info.info-dm]computer science [cs]/discrete mathematics [cs.dm] acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems Algorithms Codes Coding theory Computer Science Discrete Mathematics graph algorithm Graph theory Graphs grid identifying code locating-dominating code locating-total-dominating code Mathematical research |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELbolgMcWiggtrTIQkicrDZ2srFPaFu26oGuKihSb5bjRxuxJCUJFT-fGa930XLohWMcK7E0r2_s8TeEvAcMypXngamqKlheGTApURlWcSuyAAEx93lsNlHO5_L6Wl2mDbc-lVWufGJ01K61uEd-hMdBUiCx5Me7nwy7RuHpamqhsUW2kaksH5Htk9n88sv6HIGrvFxSNXIBmnb06eLq9CvjGRMs4xuhKDL2r_3y1i2WRf7jnWPIOdv938U-IzsJbNLpUjuek0e-2SO7q0YONNn1Hnl6sSZv7V8QN_tt7ECRBtz3FEAtHUDgnroWy2ZQkGxRf_c09aLpad1QW3exoJWaxsFzqBHK0puudjRSYve0DbT_YRYLehs3Y1-Sb2ezq9NzlpoxMAsha2AGYnsubFE6yyGuegu4wCNegwStzP0E6UUrQOqyNFIGJCIMQdgACZAxXIVj8YqMmrbxrwm1mZcWEiUnlUWuGAiIVZCqUEXFkX9wTD6s5KLvlpwbGnKVKEEdJah5poXO-JicoNjWs5ArOw603Y1OpqcNKlzwvlATg_yC8jh3Lps4AC6wWuXhdyh0jRY9dMaadDEBFovcWHo64ZCCANDKxuRgYyZYot14_Q7UZmMx59PPGsfwwrqSMrsX8I2VyujkLnr9V1_2H379hjwBxKaW9cIHZDR0v_wheWzvh7rv3ibt_wPddwxg priority: 102 providerName: ProQuest |
| Title | Exact values for three domination-like problems in circular and infinite grid graphs of small height |
| URI | https://www.proquest.com/docview/3049831175 https://hal.science/hal-01569881 https://doaj.org/article/a934efee596a4867804dd16d5219879e |
| Volume | 21 no. 3 |
| WOSCitedRecordID | wos000480436900022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: DOA dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044734695 issn: 1365-8050 databaseCode: M~E dateStart: 19980101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Continental Europe Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BFMQW dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.proquest.com/conteurope providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: M7S dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BENPR dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: PIMPY dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Nb9QwELWgcKAHPgqoC2VlISROVms72djHbdmqSOxqRYtUTpbjDxqxZFESKk78dmac7IrlwoVLpCRW4ng8fm-SyRtC3gAHFTqIyHRZ5iwrLbiULC0rhZM8AiBmIUvFJorFQl1f6-Ufpb4wJ6yXB-4H7thi8xhCricW1eHUSeY9n3iAHQiXdcDVF1jPJpgavh8InRW9RKOQMMOO382vzi6Z4EwyLnYgKCn1b9fjuzeYDvnXqpyg5vwxeThwRDrt-_aE3An1AXm0qb9AB3c8IPvzreZq-5T42U_rOorq3aGlwEVpB3YK1K8x2wXHn62qr4EOJWRaWtXUVU3KQ6W29rAfK2Sg9EtTeZqUrFu6jrT9ZlcrepPeoT4jn85nV2cXbKihwBwgTccsQHImXV54JwAOgwM4D0izIK4qsjBBVdASCLYqrFIR9QNjlC5C3GKt0PFEPid79boOh4Q6HpSD-MYr7VDiBXCsjErnOi8FygaOyNvNsJrvvVSGgRAjGcAkAxjBjTRcjMgpjvq2FUpcpwNgeDMY3vzL8HA7tJlBR-wa6-zwPwF0FiWtzHQiIHIAfsRH5GinJTiQ2zn9Gqy-05mL6QeDx_A_c60Uv5Vwjc2kMIOXtwY_USqJYqcv_scTvSQPgI7pPhn4iOx1zY_witx3t13VNmNy73S2WH4cp4k-xhzVS9z-msGZ5fv58vNv1GoCBg |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Pb9MwFLa2gQQcGAzQCgMsBOJkbXGSxj4gVPZDndZWSCvSbsZx7C2iS0YSBvxT_I285yRF5cBtB45NotRpP7_ve_Hz9wh5DRqUS8sdk2kasyjVMKXCVLOUmzBwQIiRjXyziWQ2E2dn8uMa-dXvhcGyyj4m-kCdlQbfke_icpAI0Vjy_dVXhl2jcHW1b6HRwuLE_vwOKVv97vgA_t83nB8dzvfHrOsqwAzE3oZpIKkoNHGSGQ4EYQ0QnEXhAZlGEtkh-mSmIDlFooVw6KjnXGgcKHmtuXR7Idx3ndyKMPr7UsHT5aoFl1HSGkPyEHC9ezCd758yHrCQBXyF-Hx_gCULrF9gEeZfXOAJ7mjzf_tpHpD7nZSmoxb7D8maLbbIZt-mgnZRa4vcmy6taetHJDv8oU1D0eTc1hQkO20AzpZmJRYFIUzZIv9iaddpp6Z5QU1e-XJdqosMPrschTo9r_KMesPvmpaO1pd6saAX_lXzY_LpRp78CdkoysJuE2oCKwykgZmQBp1wgO5TJ2Qs45Sju-KAvO1xoK5aRxEFmZhHjPKIUTxQoQr4gHxAmCyvQidwf6CszlUXWJTG6eSsjeVQo3ui2IuyLBhmIMtgtNLC1yHIFMarptJGd9suYLDo_KVGQw4JFsjIYEB2Vq6EOGNWTr8CmK4MZjyaKDyG2_GlEMF1CPfoIaq6YFirP_h8-u_TL8md8Xw6UZPj2ckzche0qWwro3fIRlN9s8_JbXPd5HX1ws87Sj7fNJp_A7WKZic |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Exact+values+for+three+domination-like+problems+in+circular+and+infinite+grid+graphs+of+small+height&rft.jtitle=Discrete+Mathematics+and+Theoretical+Computer+Science&rft.au=Bouznif%2C+M&rft.au=Darlay%2C+J&rft.au=Moncel%2C+J&rft.au=Preissmann%2C+M&rft.date=2019-07-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.volume=21&rft.issue=3&rft.spage=COV2&rft_id=info:doi/10.23638%2FDMTCS-21-3-12&rft.externalDocID=A627724311 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon |