Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph.
Uloženo v:
| Vydáno v: | Discrete mathematics and theoretical computer science Ročník 25:2; číslo Graph Theory |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
22.03.2024
|
| Témata: | |
| ISSN: | 1365-8050, 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 corrigendum, we give a counterexample to Theorem 5.2 in "On the
monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022)
#3]. We also present a polynomial-time algorithm for computing the monophonic
rank of a starlike graph. |
|---|---|
| AbstractList | In this corrigendum, we give a counterexample to Theorem 5.2 in "On the
monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022)
#3]. We also present a polynomial-time algorithm for computing the monophonic
rank of a starlike graph. In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph. |
| Author | da Silva, Rômulo L. O. Ponciano, Vitor S. Dourado, Mitre C. |
| Author_xml | – sequence: 1 givenname: Mitre C. surname: Dourado fullname: Dourado, Mitre C. – sequence: 2 givenname: Vitor S. surname: Ponciano fullname: Ponciano, Vitor S. – sequence: 3 givenname: Rômulo L. O. surname: da Silva fullname: da Silva, Rômulo L. O. |
| BookMark | eNpN0EtLw0AUhuFBKthWd_6AoW4UTJxrmriTeCtUurCuRIaTuTSpTSZM0oX_XklFXJ2Ps3gW7wSNGt9YhM4piUXCsvTG1L3uYkoF40doTHkio5RIMvq3T9Ck67aEUJaJ-Ri53IdQbWxj9jXuPZ6tGtyXFte-8W3pm0rjAM0n9g4D3gRoyxl-v686HWxv8Qv0ZYzXpfUhxrmv230f41ddxZiJW4YvGWHsCl_wj1N07GDX2bPfO0Vvjw_r_Dlarp4W-d0y0lRQHhmRzB3PhKCpc0lRSOM0sZDRTJiMS2e1KTh1PE2snHPKi8zZIpWkIFpoySSfosXBNR62qg1VDeFLeajU8PBhoyD0ld5ZJQUlBRBJKZUCQEKik9RlmoMwggP8WNcHSwffdcG6P48SNfRWQ2819ObfpgNx4Q |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/dmtcs.11423 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ (Directory of Open Access Journals) url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1365-8050 |
| ExternalDocumentID | oai_doaj_org_article_5410ba0511154aa5a6c68f9c3a4d43aa 10_46298_dmtcs_11423 |
| 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 |
| ID | FETCH-LOGICAL-c1413-d467f394418ff6bb5dfc0ea9194d935fecdb31f386e57313b9feb850b0c4c5253 |
| IEDL.DBID | DOA |
| ISSN | 1365-8050 |
| IngestDate | Fri Oct 03 12:44:48 EDT 2025 Sat Nov 29 02:48:27 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Graph Theory |
| Language | English |
| License | https://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1413-d467f394418ff6bb5dfc0ea9194d935fecdb31f386e57313b9feb850b0c4c5253 |
| ORCID | 0000-0002-7391-620X |
| OpenAccessLink | https://doaj.org/article/5410ba0511154aa5a6c68f9c3a4d43aa |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_5410ba0511154aa5a6c68f9c3a4d43aa crossref_primary_10_46298_dmtcs_11423 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-03-22 |
| PublicationDateYYYYMMDD | 2024-03-22 |
| PublicationDate_xml | – month: 03 year: 2024 text: 2024-03-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | Discrete mathematics and theoretical computer science |
| PublicationYear | 2024 |
| Publisher | Discrete Mathematics & Theoretical Computer Science |
| Publisher_xml | – name: Discrete Mathematics & Theoretical Computer Science |
| SSID | ssj0012947 |
| Score | 2.2900198 |
| Snippet | In this corrigendum, we give a counterexample to Theorem 5.2 in "On the
monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022)
#3]. We... In this corrigendum, we give a counterexample to Theorem 5.2 in "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]. We... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | 05c85 computer science - computational complexity computer science - discrete mathematics mathematics - combinatorics |
| Title | Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3] |
| URI | https://doaj.org/article/5410ba0511154aa5a6c68f9c3a4d43aa |
| Volume | 25:2 |
| 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: 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/eLvHCXMwrV07T8MwELYQMMDAG_HWiYcEQ0riR2Kz8RQMLR1AKkIo8lPqQIPawu_HdlJUJhbWOPJZ3935zvL5O4SO80IyKqlJhPNOTq1IE4nTIjGWUKOd4qmVsdlE0enwXk90p1p9hZqwmh64Bu6c0SxV0ptO4I2Rkslc59wJTbwASmRMjdJCTA5Tzf0BFrSoy9xpjgU_N-9jPQq8uJj8CkBTPP0xoNytoKUmE4TLegWraMYO1tDypMsCNE63hhbbP8yqo3XkrqvhMDBoms93GFdw-DgAPwzemqpQZt7XENqwQ-VAQmSjPoTXm77fHHx2DGGqFsT3-C2oRbWCpBZgeoHhFPtYewZH5G0DPd_dPl3fJ02vhERnPg4lxm94LjxyzbhzuVLMOO1hFpmgRhDmrDaKZI7w3LKCZEQJZxVnqUo11QwzsolmB9XAbiFQAmPHMsm4LqhXl_QuTVNHC5kbk2O-jU4mAJYfNSVG6Y8SEegyAl1GoLfRVUD3559AZB0_ePWWjXrLv9S78x-T7KIFjx8NpWMY76HZ8fDT7qN5_TXuj4YH0XIO0Fz3od19-Qa0bsf- |
| linkProvider | Directory of Open Access Journals |
| 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=Corrigendum+to+%22On+the+monophonic+rank+of+a+graph%22+%5BDiscrete+Math.+Theor.+Comput.+Sci.+24%3A2+%282022%29+%233%5D&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Mitre+C.+Dourado&rft.au=Vitor+S.+Ponciano&rft.au=R%C3%B4mulo+L.+O.+da+Silva&rft.date=2024-03-22&rft.pub=Discrete+Mathematics+%26+Theoretical+Computer+Science&rft.eissn=1365-8050&rft.volume=25%3A2&rft.issue=Graph+Theory&rft_id=info:doi/10.46298%2Fdmtcs.11423&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_5410ba0511154aa5a6c68f9c3a4d43aa |
| 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 |