Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Daniel A. Jaume"'
Publikováno v:
Revista de la Unión Matemática Argentina. :223-238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9244ad1cdc391a21be0ed49e537b944f
https://doi.org/10.33044/revuma.1145
https://doi.org/10.33044/revuma.1145
Publikováno v:
Communications in Computer and Information Science ISBN: 9783031341465
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::895c26ec2930ede0a17251c13b89b3da
https://doi.org/10.1007/978-3-031-34147-2_16
https://doi.org/10.1007/978-3-031-34147-2_16
Publikováno v:
Linear Algebra and its Applications. 614:176-196
In this work we study the null space of bipartite graphs without cycles of length 0 modulo 4 (denoted as C 4 k -free bipartite graphs), and its relation to structural properties. We extend the Null Decomposition of trees, introduced by Jaume and Moli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7be0258d24843277354db06724288e4
https://doi.org/10.1016/j.laa.2020.03.030
https://doi.org/10.1016/j.laa.2020.03.030
Publikováno v:
Brazilian Journal of Development. 7:29011-29020
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a05245f750e3c582138ba7712b9e6d7
https://doi.org/10.34117/bjdv7n3-561
https://doi.org/10.34117/bjdv7n3-561
Publikováno v:
Discrete Applied Mathematics. 285:594-611
We find a basis for the null space of the adjacency matrix of unicyclic graphs. Based on the support of such a basis, we determine a null decomposition of these graphs. As an application, we obtain closed formulas for the independence and matching nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e41151472c4d1802fdbaf3fa3b0aec2
https://doi.org/10.1016/j.dam.2020.06.025
https://doi.org/10.1016/j.dam.2020.06.025
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
We present a necessary and sufficient condition for the singularity of circulant matrices associated with directed weighted cycles. This condition is simple and independent of the order of matrices from a complexity point of view. We give explicit an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd46c279a40fa276f2c10091fef7930d
https://doi.org/10.33044/revuma.v61n2a02
https://doi.org/10.33044/revuma.v61n2a02
Publikováno v:
Revista Mundi Engenharia, Tecnologia e Gestão (ISSN: 2525-4782). 6
Seja G um grafo com n vertices e 𝐺𝑐 seu complemento. O numero de aniquilacao de G, denotado por a(G), e o maior numero inteiro k tal que a soma dos k menores graus de G nao ultrapassa seu numero de arestas. Esse invariante e usado como cota sup
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebd8be4af28a42465b0d5f0c74641597
https://doi.org/10.21575/25254782rmetg2021vol6n31662
https://doi.org/10.21575/25254782rmetg2021vol6n31662
Autor:
Daniel A. Jaume, Rodrigo Sota
Publikováno v:
Linear Algebra and its Applications. 563:207-214
In this work we show, through the null decomposition of trees given by Jaume and Molina (2018) [3] , that the core-nilpotent decomposition of A ( T ) , the adjacency matrix of a tree T, can be obtained directly from the tree itself. In other words, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62370c03d27c19caf4e2a3543e9f28ad
https://doi.org/10.1016/j.laa.2018.10.012
https://doi.org/10.1016/j.laa.2018.10.012
Publikováno v:
Pesquisa como Princípio Educativo: O que podemos aprender com a Pesquisa em Matemática?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::366f982a2cccc1b5e8bec8123638c280
https://doi.org/10.22533/at.ed.0772128041
https://doi.org/10.22533/at.ed.0772128041