Zobrazeno 1 - 10
of 35
pro vyhledávání: '"S. C. López"'
Autor:
S. C. López, Ali Ahmad
Publikováno v:
Mathematical Problems in Engineering, Vol 2021 (2021)
Repositorio Abierto de la UdL
Universitad de Lleida
Repositorio Abierto de la UdL
Universitad de Lleida
Let R be a commutative ring with nonzero identity and let Z R be its set of zero divisors. The zero-divisor graph of R is the graph Γ R with vertex set V Γ R = Z R ∗ , where Z R ∗ = Z R \ 0 , and edge set E Γ R = x , y : x ⋅ y = 0 . One of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35e2d08599b5f03eb439cf2e646c4d41
https://doi.org/10.1155/2021/4959559
https://doi.org/10.1155/2021/4959559
Publikováno v:
Repositorio Abierto de la UdL
Universitad de Lleida
Universitad de Lleida
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::461497d4bf04071c2ff1fd06f0f654ad
https://doi.org/10.1007/s00025-020-1166-9
https://doi.org/10.1007/s00025-020-1166-9
Publikováno v:
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a path of order 2m in which each label from d up to d + m − 1 appears twice and in which the vertices that have been labeled with k are at distance k.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8067b1da70c438c58f8fc6bf84b4dd6
https://doi.org/10.26493/1855-3974.896.fbf
https://doi.org/10.26493/1855-3974.896.fbf
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
Recercat. Dipósit de la Recerca de Catalunya
instname
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 683-701 (2018)
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
Recercat. Dipósit de la Recerca de Catalunya
instname
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 683-701 (2018)
The beta-number, ß (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) ¿ {0, 1, . . . , n} such that each uv ¿ E (G) is labeled |f (u) - f (v)| and the resulting set of e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a50d29a3fd7834d214a654772360ea9a
http://hdl.handle.net/2117/121742
http://hdl.handle.net/2117/121742
Autor:
Helga Zoega, Koji Kawakami, Yu-Chiau Shyu, Svetlana Skurtveit, Manuel Enrique Machado-Duque, Leena K. Saastamoinen, Miguel Bernardo, C. Zara Yahni, Takuya Kinoshita, Lise Aagaard, Helle Kieler, Samantha A. Hollingworth, Kari Furu, Catharina C. M. Schuiling-Veninga, Liang-Jen Wang, A. Coma Fusté, Christian Bachmann, Lena Brandt, Kristina Garuoliene, Prasad S. Nishtala, Izumi Sato, David Taylor, S. C. López, Falk Hoffmann, Johan Reutfors, Hélène Verdoux, Dan Siskind, Jorge Enrique Machado-Alba, Luuk J. Kalverdijk, Mufaddal Mahesri, Daniele Piovani, Antonio Clavenna, Krista F. Huybrechts, Marta Cartabia
Publikováno v:
Acta Psychiatrica Scandinavica, 136(1), 37-51. Wiley
Objective: There is some evidence that clozapine is significantly underutilised. Also, clozapine use is thought to vary by country, but so far no international study has assessed trends in clozapine prescribing. Therefore, this study aimed to assess
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2be7ddbfb083b64e390a30ffb277c6a7
https://research.rug.nl/en/publications/cb0a309a-f4aa-4bee-9c82-5a20e12bf1db
https://research.rug.nl/en/publications/cb0a309a-f4aa-4bee-9c82-5a20e12bf1db
Autor:
S. C. López
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Repositorio Abierto de la UdL
Universitad de Lleida
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d790dcd2e4649b3492bb9bd87b87098d
https://hdl.handle.net/2117/111692
https://hdl.handle.net/2117/111692
Autor:
Andrea Semaničová-Feňovčíková, Faraha Ashraf, Akito Oshima, Francesc-Antoni Muntaner-Batle, Martin Bača, S. C. López
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 181-194 (2020)
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::930377bdf00692485a1b9937df231e31
https://doi.org/10.7151/dmgt.2118
https://doi.org/10.7151/dmgt.2118
Publikováno v:
Repositorio Abierto de la UdL
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitad de Lleida
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
In this paper we continue the study of the valences for (super) edge-magic labelings of crowns $C_{m}\odot \overline K_{n}$ and we prove that the crowns are perfect (super) edge-magic when $m=pq$ where $p$ and $q$ are different odd primes. We also pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::809860ddd5bb8da9eb9af5ce8bd4f667
https://hdl.handle.net/10459.1/66441
https://hdl.handle.net/10459.1/66441
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.90-104
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.90-104
An arc colored eulerian multidigraph with $l$ colors is rainbow eulerian if there is an eulerian circuit in which a sequence of $l$ colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno et al. as follows: let $D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8d12a9a1e398633870d43ccdacb051e
https://hal.inria.fr/hal-01352847/file/2731-9907-1-PB.pdf
https://hal.inria.fr/hal-01352847/file/2731-9907-1-PB.pdf
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
Repositorio Abierto de la UdL
Universitad de Lleida
instname
Repositorio Abierto de la UdL
Universitad de Lleida
Let G be any graph and let {Hi}i∈I be a family of graphs such that E(Hi) ∩ E(Hj ) = ∅ when i 6= j, ∪i∈IE(Hi) = E(G) and E(Hi) 6= ∅ for all i ∈ I. In this paper we introduce the concept of {Hi}i∈I -super edge-magic decomposable graphs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77938c073bfae17c860362a131d00b0b
https://doi.org/10.1007/s13226-012-0028-x
https://doi.org/10.1007/s13226-012-0028-x