| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Incidence dimension and 2-packing number in graphs
Authors:ID Božović, Dragana (Author)
ID Kelenc, Aleksander (Author)
ID Peterin, Iztok (Author)
ID Yero, Ismael G. (Author)
Files:URL https://www.rairo-ro.org/articles/ro/abs/2022/01/ro190152/ro190152.html
 
.pdf Incidence_dimension_and_2-packing-Bozovic-2022.pdf (434,03 KB)
MD5: F5850F22AE513CB83BC52397E8A18D98
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Let ▫$G=(V,E)$▫ be a graph. A set of vertices ▫$A$▫ is an incidence generator for ▫$G$▫ if for any two distinct edges ▫$e,f \in E(G)$▫ there exists a vertex from ▫$A$▫ which is an endpoint of either ▫$e$▫ or ▫$f$▫. The smallest cardinality of an incidence generator for ▫$G$▫ is called the incidence dimension and is denoted by ▫$\dim_I(G)$▫. A set of vertices ▫$P \subseteq V(G)$▫ is a 2-packing of ▫$G$▫ if the distance in ▫$G$▫ between any pair of distinct vertices from ▫$P$▫ is larger than two. The largest cardinality of a 2-packing of ▫$G$▫ is the packing number of ▫$G$▫ and is denoted by ▫$\rho(G)$▫. In this article, the incidence dimension is introduced and studied. The given results show a close relationship between ▫$\dim_I(G)$▫ and ▫$\rho(G)$▫. We first note that the complement of any 2-packing in graph ▫$G$▫ is an incidence generator for ▫$G$▫, and further show that either ▫$\dim_I(G)=|V(G)|-\rho(G)$▫ or ▫$\dim_I(G)=|V(G)-|\rho(G)-1$▫ for any graph ▫$G$▫. In addition, we present some bounds for ▫$\dim_I(G)$▫ and prove that the problem of determining the incidence dimension of a graph is NP-hard.
Keywords:incidence dimension, incidence generator, 2-packing
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2022
Year of publishing:2022
Number of pages:str. 199-211
Numbering:Letn. 56, št. 1
PID:20.500.12556/DKUM-85102 New window
UDC:519.17
ISSN on article:0399-0559
COBISS.SI-ID:96612611 New window
DOI:10.1051/ro/2022001 New window
Publication date in DKUM:18.08.2023
Views:450
Downloads:61
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:RAIRO-Operations Research
Shortened title:RAIRO Oper. Res.
Publisher:EDP Sciences
ISSN:0399-0559
COBISS.SI-ID:26238976 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:J1-1693
Name:Sodobni in novi metrični koncepti v teoriji grafov

Funder:ARRS - Slovenian Research Agency
Project number:J1-9109
Name:Sodobne invariante grafov

Funder:Other - Other funder or multiple funders
Project number:PID2019-105824GB-I00

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Incidenčna dimenzija in 2-pakirno število grafov
Abstract:Naj bo ▫$G=(V,E)$▫ graf. Množica vozlišč ▫$A$▫ je incidenčni generator grafa ▫$G$▫, če za poljubni različni vozlišči ▫$e,f \in E(G)$▫ obstaja vozlišče iz ▫$A$▫, ki je incidenčno z ali ▫$e$▫ ali ▫$f$▫. Najmanjšemu kardinalnemu številu incidenčnega generatorja grafa ▫$G$▫ račemo incidenčna dimenzija, kar označmo z ▫$\dim_I(G)$▫. Množica vozlišč ▫$P \subseteq V(G)$▫ je 2-pakiranje grafa ▫$G$▫, če je razdalja med poljubnima vozliščema iz ▫$P$▫ vsaj tri. Največja kardinalnost 2-pakiranja grafa ▫$G$▫ je pakirno število grafa ▫$G$▫, ki ga označimo z ▫$\rho(G)$▫. V tem delu vpeljemo incidenčno dimenzijo. Predstavljeni rezultati pokažejo tesno prepletenost med ▫$\dim_I(G)$▫ in ▫$\rho(G)$▫. Najprej opazimo, da je komplement vsakega 2-pakiranja grafa ▫$G$▫ hkrati tudi incidenčni generator grafa ▫$G$▫, Nadalje pokažemo, da velja ali ▫$\dim_I(G)=|V(G)|-\rho(G)$▫ ali ▫$\dim_I(G)=|V(G)-|\rho(G)-1$▫ ua vsak graf ▫$G$▫. Dodatno predstavimo več mej za ▫$\dim_I(G)$▫ in dokažemo, da je določitveni problem incidenčne dimenzije grafa NP-težek.
Keywords:incidenčna dimenzija, incidenčni generator, 2-pakiranje


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica