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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Mathematics and Theoretical Computer Science Jg. 21 no. 3; H. Graph Theory; S. COV2 - 21
Hauptverfasser: Bouznif, Marwane, Darlay, Julien, Moncel, Julien, Preissmann, Myriam
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Nancy DMTCS 01.07.2019
Discrete Mathematics & Theoretical Computer Science
Schlagworte:
[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
France
locating-dominating code
locating-total-dominating code
identifying code
graph algorithm
grid
ISSN:1365-8050, 1462-7264, 1365-8050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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 Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest 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 M7S
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://www.proquest.com/docview/3049831175?pq-origsite=%requestingapplication%
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: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9swDBa6ooftsD62omnTQigG7CQ0lhTbOqYv5JAWBdYNvQmKHqvR1BlsN9jPHyk7wdJLLwV8sUzDEimKpEV9JOQbT8GKm3TIplJIJl0QzKhBYDLYVMHlbAQw_TXJbm_zhwd191-pL8wJa-GBW8adGSWkD94PVWoQHS4fSOeS1IHZgXBZeVx9wetZBlPd_gFXMmshGrmAGXZ2eXN_8YPxhAmW8DUTFJH6V-vxh0dMh3y1KkdTc71DPnc-Ih21fdslG77cI9vL-gu0U8c98ulmhblafyHu6q-xDUX0bl9T8EVpA3Ly1M0x2wX5z2bFk6ddCZmaFiW1RRXzUKkpHdyHAj1Q-rsqHI1I1jWdB1o_m9mMPsZ_qF_Jz-ur-4sx62ooMAuWpmEGTLIUdpg5y8Ecegvm3KObBXFVJn2KqKBTcLDzzOR5QPzAEIQNELcYw1UYiH2yWc5Lf0Co8_CuE87A8i4t0PtgfDLlDun4QPTI9yVb9Z8WKkNDiBEFoKMANE-00AnvkXPk-ooKIa5jAwhed4LXbwkePocy06iITWWs6c4TQGcR0kqPUg6RA_hHSY_01yhBgeza41OQ-lpnxqOJxjY8Z67yPFnA4PrLSaE7La81blHmAsFOD99jREfkI7hjqk0G7pPNpnrxx2TLLpqirk7iBP8HC-T9kg
  priority: 102
  providerName: Directory of Open Access Journals
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/eLvHCXMwpV3Nb9MwFLfYxgEODAYThVJZCImTtcZ2k_iEutFpSGtVsYHGyXL9sUWUZCRh4sTfzntuWlQOXJCiSIkdxdH7-tl--T1C3vAUorhJR2whhWTSBcGMGgYmg00VHM5GAtPP59lsll9dqXm34NZ0aZVrnxgdtassrpEf4XZQLpBY8t3td4ZVo3B3tSuhsUP2kCWBx9S9i80uAlcyWxE1cgF6dvR-enlywXjCBEv4ViCKfP0br7xzg0mRf_nmGHBO9_93qI_Jow5q0vFKN56Qe748IPvrMg60s-oD8nC6oW5tnhI3-WlsS5EE3DcUIC1tQdyeugqTZlCMbFl89bSrRNPQoqS2qGM6KzWlg-tQIJCl13XhaCTEbmgVaPPNLJf0Ji7FPiOfTieXJ2esK8XALASslhmI7FLYUeYsh6jqLaACj2gNpmeZ9CmSiy4Ap-eZyfOANIQhCBtg-mMMV2EoDsluWZX-OaHOw7NOOANRQlro74PxyYI77MeHokferuWib1eMGxpmKlGCOkpQ80QLnfAeOUaxbXohU3a8UdXXujM8bZSQPng_UqlBdsF8KJ1LUgewBUarPLwOha7RntvaWNP9lgCDRWYsPU45TEAAZiU90t_qCXZot5pfg9psDeZsfK7xHv6urvI8uYOP669VRnfOotF_9OXFv5tfkgeA19QqW7hPdtv6h39F7tu7tmjqAdk7nszmHwdxWWEQLQHPvybQMv8wnX_5DQq_EZg
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtNAFL1qUyRgQaGAGggwQjxWo8Yzjh8LFukjStUkAhGgu2Eyj9ZqSIptCvwU38i9jhMUFuy6QPLG9sSZ2Cf3nPHcORfghYiQxXXU4ZNQhjy0XnKdtj0PvYlS3KypDEw_DuLRKDk9Td9uwK_lWhhKq1zGxCpQ27mhd-R7NB2USDKWrDMoT9zP7zg-K94cH-LDfClE72h80Od1CQFuMNCWXCMjhdJ0YmsEsoEzyGaOVAYOK-LQRWSKOUF9mcQ6STzZ53kvjUfZrrVIfVvidV9dfuVUpYpmc-uSHZuwlUSpDBuwtd8bvvu0mrcQaRgvrCGFRGTvHQ7HB--5CLjkgVijvqpCwIoHNs8pDfMvNqgorrf9v92cu3CnFtOsu0D_Pdhwsx3YXhaqYHXc2oHbw5U5bXEf7NEPbUpGNueuYCjaWYmAdszOKS2IgMqn2YVjda2dgmUzZrK8SthlemZx32ck1dlZnllWWX4XbO5Z8UVPp-y8etn8AD5cy814CI3ZfOZ2gVmHn7XSauTB0GB757ULJsJSO9GWTXi9xIG6XHiKKByLVYhRFWKUCJRUgWjCPsFk1Yq8wKsD8_xM1aFFaQSi88510kiTf2LSDq0NIovCDHubOvw6ApmiiFXm2uh64QV2lry_VDcSOMRCIRk0obXWEiONWTv9HGG61pl-d6DoGC3IT5MkuMIf11pCVNXhsFB_8Pno36efwc3-eDhQg-PRyWO4heo0XeRGt6BR5t_cE7hhrsqsyJ_W_zwGn68b4r8BLSlomQ
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+Marwane&rft.au=Darlay%2C+Julien&rft.au=Moncel%2C+Julien&rft.au=Preissmann%2C+Myriam&rft.date=2019-07-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.eissn=1365-8050&rft.volume=21+no.+3&rft.issue=3&rft_id=info:doi/10.23638%2FDMTCS-21-3-12&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01569881v3
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