:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Estrada-Moreno, Alejandro, Fernández, Elena, Kuziak, Dorota, Muñoz-Márquez, Manuel, Trujillo-Rasua, Rolando, Yero, Ismael G.
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Information Theory
Acceso en línea:	https://arxiv.org/abs/2507.08433
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the weak $k$-metric dimension of Hamming graphs
por: Fernandez, Elena, et al.
Publicado: (2025)

The weak $k$-metric dimension of the direct product of complete graphs
por: Farhan, Mohammad, et al.
Publicado: (2026)

Coloring the vertices of a graph with mutual-visibility property
por: Klavžar, Sandi, et al.
Publicado: (2024)

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

Complexity and equivalency of multiset dimension and ID-colorings
por: Hakanen, Anni, et al.
Publicado: (2023)

Moving through Cartesian products, coronas and joins in general position
por: Klavžar, Sandi, et al.
Publicado: (2025)

A multiset approach to MacWilliams identities
por: Tang, Hopein Christofen
Publicado: (2025)

Burning some myths on privacy properties of social networks against active attacks
por: Cicerone, Serafino, et al.
Publicado: (2025)

General position problems in strong and lexicographic products of graphs
por: Dokyeesun, Pakanun, et al.
Publicado: (2024)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
por: Gabric, Daniel, et al.
Publicado: (2026)

Maker-Breaker resolving game played on corona products of graphs
por: James, Tijo, et al.
Publicado: (2024)

Equidistant dimension of Cartesian product graphs
por: Gispert-Fernandez, Adria, et al.
Publicado: (2025)

On lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$
por: Leung, Ka Hin, et al.
Publicado: (2025)

Nonvanishing $k$-flats of Boolean and vectorial functions
por: Kaspers, Christian
Publicado: (2026)

Bounds on $k$-hash distances and rates of linear codes
por: Della Fiore, Stefano, et al.
Publicado: (2025)

Geometric construction of k-optimal locally repairable codes
por: Fu, Yi, et al.
Publicado: (2026)

On the independence number of de Bruijn graphs
por: Majer, Pietro, et al.
Publicado: (2026)

Edge inducibility via local directed graphs
por: Chao, Ting-Wei, et al.
Publicado: (2025)

Generalized graph codes and thier minimum distances
por: Fujii, Naoki
Publicado: (2025)

On the stabilizer of the graph of linear functions over finite fields
por: Smaldore, Valentino, et al.
Publicado: (2024)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
por: Abiad, Aida, et al.
Publicado: (2024)

Mutual-visibility in strong products of graphs via total mutual-visibility
por: Cicerone, Serafino, et al.
Publicado: (2022)

Injective coloring of product graphs
por: Samadi, Babak, et al.
Publicado: (2023)

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
por: Sason, Igal
Publicado: (2025)

Reconstructing graphs with subgraph compositions
por: Dailly, Antoine, et al.
Publicado: (2025)

Identifying Young diagrams among residue multisets
por: Rostam, Salim
Publicado: (2020)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)

On the unicyclic graphs having vertices that belong to all their (strong) metric bases
por: Hakanen, Anni, et al.
Publicado: (2022)

Injective colorings of Sierpiński-like graphs and Kneser graphs
por: Brešar, Boštjan, et al.
Publicado: (2024)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
por: Mossel, Elchanan, et al.
Publicado: (2024)

Traversing a graph in general position
por: Klavžar, Sandi, et al.
Publicado: (2022)

Storage codes on coset graphs with asymptotically unit rate
por: Barg, Alexander, et al.
Publicado: (2022)

Trellis codes with a good distance profile constructed from expander graphs
por: Zhu, Yubin, et al.
Publicado: (2026)

Hilton-Milner theorem for $k$-multisets
por: Liao, Jiaqi, et al.
Publicado: (2023)

The $k$-distance mutual-visibility problem in graphs
por: Cera, M., et al.
Publicado: (2024)

Independent mutual-visibility coloring and related concepts
por: Brešar, Boštjan, et al.
Publicado: (2025)

On Vertices Contained in All or in No Metric Basis
por: Hakanen, Anni, et al.
Publicado: (2021)

On constrained intersection representations of graphs and digraphs
por: Cicalese, Ferdinando, et al.
Publicado: (2025)

Upper bounds on the rate of linear $q$-ary $k$-hash codes
por: Della Fiore, Stefano, et al.
Publicado: (2024)

On tight $(k,\ell)$-stable graphs
por: Liu, Xiaonan, et al.
Publicado: (2024)