Graphs with isolation number equal to one third of the order
| UDC.coleccion | Investigación | es_ES |
| UDC.departamento | Matemáticas | es_ES |
| UDC.grupoInv | Xeometría Diferencial e as súas Aplicacións (XDA) | es_ES |
| UDC.issue | 5 | es_ES |
| UDC.journalTitle | Discrete Mathematics | es_ES |
| UDC.startPage | 113903 | es_ES |
| UDC.volume | 347 | es_ES |
| dc.contributor.author | Lemańska, Magdalena | |
| dc.contributor.author | Mora, Mercè | |
| dc.contributor.author | Souto Salorio, María José | |
| dc.date.accessioned | 2024-02-20T13:31:18Z | |
| dc.date.embargoEndDate | 2026-05-01 | es_ES |
| dc.date.embargoLift | 2026-05-01 | |
| dc.date.issued | 2024-05 | |
| dc.description | © 2024. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/. This version of the article has been accepted for publication in Discrete Mathematics (ISSN 2578-9252). The Version of Record is available online at 10.1016/j.disc.2024.113903. | es_ES |
| dc.description.abstract | [Absctract]: A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by ι(G), is the minimum cardinality of an isolating set of G. It`s known that ι(G) ≤ n/3, if G is a connected graph of order n, n ≥ 3, distinct from C5. The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number equal to n/3. Moreover, we provide a family of general graphs attaining this upper bound on the isolation number. | es_ES |
| dc.description.sponsorship | Partially supported by projects PID2019-104129GB-I00/MCIN/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation and Gen.Cat. DGR2021SGR00266. Partially supported by project PID2020-113230RB-C21 of the Spanish Ministry of Science and Innovation. | es_ES |
| dc.identifier.citation | M. Lemańska, M. Mora, y M. J. Souto-Salorio, «Graphs with isolation number equal to one third of the order», Discrete Mathematics, vol. 347, n.o 5, p. 113903, may 2024, doi: 10.1016/j.disc.2024.113903. | es_ES |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.issn | 2578-9252 | |
| dc.identifier.uri | http://hdl.handle.net/2183/35675 | |
| dc.language.iso | eng | es_ES |
| dc.publisher | Elsevier B.V. | es_ES |
| dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104129GB-I00/ES/TEORIA Y APLICACIONES DE CONFIGURACIONES DE PUNTOS Y REDES/ | es_ES |
| dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2020-113230RB-C21/ES/MODELOS MULTITAREA DE ETIQUETADO SECUENCIAL PARA EL RECONOCIMIENTO DE ENTIDADES ENRIQUECIDO CON INFORMACION LINGUISTICA: SINTAXIS E INTEGRACION MULTITAREA (SCANNER-UDC)/ | es_ES |
| dc.relation.uri | https://doi.org/10.1016/j.disc.2024.113903 | es_ES |
| dc.rights | Atribución-NoComercial-SinDerivadas 3.0 España | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
| dc.subject | Isolation | es_ES |
| dc.subject | Domination | es_ES |
| dc.subject | Unicyclic graphs | es_ES |
| dc.subject | Block graphs | es_ES |
| dc.title | Graphs with isolation number equal to one third of the order | es_ES |
| dc.type | journal article | es_ES |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 7f4f47e1-7bf0-4a4a-bdb2-b1b5f90e26d1 | |
| relation.isAuthorOfPublication.latestForDiscovery | 7f4f47e1-7bf0-4a4a-bdb2-b1b5f90e26d1 |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Lemanska_Mardalena_2024_Graphs_with_isolation_number_equal_one_third_of_the_order.pdf
- Size:
- 656.92 KB
- Format:
- Adobe Portable Document Format
- Description:
- Accepted Manuscript

