Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Falcón Raúl M."'
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 32, Iss 2, Pp 53-84 (2024)
Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the b-chromatic number of every subdivision-vertex neighbourhood corona G ⊡ H or G ⊡ Kn, where Kn is the complete graph of order n. It is als
Externí odkaz:
https://doaj.org/article/1eb4d4ac9e2e4c60a0eadda80c9eb418
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 31, Iss 1, Pp 115-142 (2023)
This paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n. The problem is completely solved except for the case n
Externí odkaz:
https://doaj.org/article/78e731aed58e4212a5860fa888273316
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 29, Iss 3, Pp 151-181 (2021)
In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and
Externí odkaz:
https://doaj.org/article/89c3ab1229a843eeb956e83a546f6186
Autor:
Falcón, Raúl M., Mella, Lorenzo
A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$. In this pap
Externí odkaz:
http://arxiv.org/abs/2410.23216
The Hadamard quasigroup product has recently been introduced as a natural generalization of the classical Hadamard product of matrices. It is defined as the superposition operator of three binary operations, one of them being a quasigroup operation.
Externí odkaz:
http://arxiv.org/abs/2410.23183
Now-a-days, ensuring data security has become an increasingly formidable challenge in safeguarding individuals' sensitive information. Secret-sharing scheme has evolved as a most successful cryptographic technique that allows a secret to be divided o
Externí odkaz:
http://arxiv.org/abs/2404.16843
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 24, Iss 2, Pp 185-204 (2016)
This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over
Externí odkaz:
https://doaj.org/article/900cdfa5b41743febc2672522385fb0c
Let $G$ and $H$ be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the $b$-chromatic number of every subdivision-vertex neighbourhood corona $G\boxdot H$ or $G\boxdot K_n$, where $K_n$ is the complete graph o
Externí odkaz:
http://arxiv.org/abs/2302.13667
In this paper, a new family of rotationally symmetric planar graphs is described based on an edge coalescence of planar chorded cycles. Their local fractional metric dimension is established for those ones arisen from chorded cycles of order up to si
Externí odkaz:
http://arxiv.org/abs/2105.07808
Publikováno v:
Computational and Mathematical Methods 3:3 (2021) paper e1094
Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (b) to identify the design goals one should have in mind for developing
Externí odkaz:
http://arxiv.org/abs/1910.10103