| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Packings in bipartite prisms and hypercubes
Authors:ID Brešar, Boštjan (Author)
ID Klavžar, Sandi (Author)
ID Rall, Douglas F. (Author)
Files:URL https://www.sciencedirect.com/science/article/pii/S0012365X24000062
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:▫$2$▫-pakirno število ▫$\rho_2(G)$▫ grafa ▫$G$▫ je kardinalnost največjega ▫$2$▫-pakiranja grafa ▫$G$▫, odprto pakirno število ▫$\rho^{\rm o}(G)$▫ pa kardinalnost največjega odprtega pakiranja grafa ▫$G$▫, kjer je odprto pakiranje (oz. ▫$2$▫ pakiranje) množica vozlišč grafa ▫$G$▫, katerih dve (zaprti) soseščini se ne sekata. Dokazano je, da če je ▫$G$▫ dvodelen, potem je ▫$\rho^{\rm o}(G\Box K_2) = 2\rho_2(G)$▫. Za hiperkocke sta določeni spodnji meji ▫$\rho_2(Q_n) \ge 2^{n - \lfloor \log n\rfloor -1}$▫ in ▫$\rho^{\rm o}(Q_n) \ge 2^{n - \lfloor \log (n-1)\rfloor -1}$▫. Te ugotovitve so uporabljene za injektivna barvanja hiperkock. Dokazano je, da je ▫$Q_9$▫ najmanjša hiperkocka, ki ni popolno injektivno obarvljiva. Dokazano je tudi, da je ▫$\gamma_t(Q_{2^k}\times H) = 2^{2^k-k}\gamma_t(H)$▫, kjer je ▫$H$▫ poljuben graf brez izoliranih vozlišč.
Keywords:2-pakirno število, odprto pakirno število, dvodelna prizma, hiperkocke, injektivno barvanje, celotno dominacijsko število, 2-packing number, open packing number, bipartite prism, hypercube, injective coloring, total domination number
Year of publishing:2024
Number of pages:6 str.
Numbering:ǂVol. ǂ347, ǂiss. ǂ4, [article no.] 113875
PID:20.500.12556/DKUM-87124 New window
UDC:519.17
ISSN on article:0012-365X
COBISS.SI-ID:181387523 New window
DOI:10.1016/j.disc.2024.113875 New window
Publication date in DKUM:28.02.2024
Views:469
Downloads:13
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:Discrete mathematics
Shortened title:Discrete math.
Publisher:North-Holland
ISSN:0012-365X
COBISS.SI-ID:1118479 New window

Secondary language

Language:Slovenian
Title:Pakiranja v dvodelnih prizmah in hiperkockah
Abstract:The ▫$2$▫-packing number ▫$\rho_2(G)$▫ of a graph ▫$G$▫ is the cardinality of a largest ▫$2$▫-packing of ▫$G$▫ and the open packing number ▫$\rho^{\rm o}(G)$▫ is the cardinality of a largest open packing of ▫$G$▫, where an open packing (resp. ▫$2$▫-packing) is a set of vertices in ▫$G$▫ no two (closed) neighborhoods of which intersect. It is proved that if ▫$G$▫ is bipartite, then ▫$\rho^{\rm o}(G\Box K_2) = 2\rho_2(G)$▫. For hypercubes, the lower bounds ▫$\rho_2(Q_n) \ge 2^{n - \lfloor \log n\rfloor -1}$▫ and ▫$\rho^{\rm o}(Q_n) \ge 2^{n - \lfloor \log (n-1)\rfloor -1}$▫ are established. These findings are applied to injective colorings of hypercubes. In particular, it is demonstrated that ▫$Q_9$▫ is the smallest hypercube which is not perfect injectively colorable. It is also proved that ▫$\gamma_t(Q_{2^k}\times H) = 2^{2^k-k}\gamma_t(H)$▫, where ▫$H$▫ is an arbitrary graph with no isolated vertices.
Keywords:2-pakirno število, odprto pakirno število, dvodelna prizma, hiperkocke, injektivno barvanje, celotno dominacijsko število


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