Zobrazeno 1 - 10
of 284
pro vyhledávání: '"BAČA, Martin"'
Publikováno v:
Fundamenta Informaticae, Volume 185, Issue 2 (May 6, 2022) fi:9336
Let $G = (V, E)$ be a finite simple undirected graph without $K_2$ components. A bijection $f : E \rightarrow \{1, 2,\cdots, |E|\}$ is called a local antimagic labeling if for any two adjacent vertices $u$ and $v$, they have different vertex sums, i.
Externí odkaz:
http://arxiv.org/abs/2204.04479
Publikováno v:
In Discrete Mathematics August 2024 347(8)
Autor:
Poulkouras, Romanos, Dijk, Gerwin, Lefevre, Marie, Bača, Martin, Moreau, David, O'Connor, Rodney P.
Publikováno v:
In Bioelectrochemistry October 2022 147
Autor:
Serván-Mori, Edson, Ramírez-Baca, Martín I., Fuentes-Rivera, Evelyn, García-Martínez, Angélica, Quezada-Sánchez, Amado D., del Carmen Hernández-Chávez, María, Olvera-Flores, Fabián, Pineda-Pérez, Dayana, Zelocuatecatl-Aguilar, Alberto, Orozco-Núñez, Emanuel, Schnaas, Lourdes
Publikováno v:
In Acta Psychologica October 2022 230
Autor:
Bača, Martin
Publikováno v:
Historický časopis / Journal of History. 70(3):487-513
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=1080118
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 2, Pp 549-568 (2022)
We investigate face irregular labelings of plane graphs and we introduce new graph characteristics, namely face irregularity strength of type (α,β,γ). We obtain some estimation on these parameters and determine the precise values for certain famil
Externí odkaz:
https://doaj.org/article/46f728f7949a43fd95bdc3d7f2e1a5ef
Autor:
Bača, Martin, López, Susana-Clara, Muntaner-Batle, Francesc-Antoni, Semaničová-Feňovčíková, Andrea
Let $D$ be a digraph, possibly with loops. A queen labeling of $D$ is a bijective function $l:V(G)\longrightarrow \{1,2,\ldots,|V(G)|\}$ such that, for every pair of arcs in $E(D)$, namely $(u,v)$ and $(u',v')$ we have (i) $l(u)+l(v)\neq l(u')+l(v')$
Externí odkaz:
http://arxiv.org/abs/1703.09942
Autor:
Naeem Muhammad, Siddiqui Muhammad Kamran, Bača Martin, Semaničová-Feňovčíková Andrea, Ashraf Faraha
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 4, Pp 949-961 (2021)
For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering. A
Externí odkaz:
https://doaj.org/article/80453cff655540bca9ac5432e90fa5e3
Autor:
Bača, Martin
This diploma thesis deals with the ideological design and realization of digital room thermostat and a temperature sensor selection. The device is designed as three units communicating wirelessly. Outdoor unit and control units sensor provide data fo
Externí odkaz:
http://www.nusl.cz/ntk/nusl-219934