Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Rosalío Reyes"'
Publikováno v:
Symmetry, Vol 10, Iss 9, p 360 (2018)
A graph operator is a mapping F : Γ → Γ ′ , where Γ and Γ ′ are families of graphs. The different kinds of graph operators are an important topic in Discrete Mathematics and its applications. The symmetry of this operations allows us to pro
Externí odkaz:
https://doaj.org/article/4e6297a7ae764bffb2cbf1fddee936b6
Publikováno v:
Symmetry, Vol 9, Iss 11, p 255 (2017)
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. In particular, we are interested in interval and indifference graphs, which are important classes of intersection and Eucl
Externí odkaz:
https://doaj.org/article/a23bbe4c265346bb897449fd9e27535f
How patterning by morphogen gradients determine tradeoffs between robustness and precision is unclear. Gradients that exhibit self-enhanced ligand degradation provide robustness to perturbations in morphogen production rates. However, increased robus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01de1f1e996bfab2bc1e2e505d72aa97
https://doi.org/10.1101/2022.12.21.521489
https://doi.org/10.1101/2022.12.21.521489
Publikováno v:
Journal of Mathematical Chemistry. 59:775-791
The atom-bond connectivity and the generalized atom-bond connectivity indices have shown to be useful in the QSPR/QSAR researches. The aim of this paper is to obtain new inequalities for these indices and characterize graphs extremal with respect to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e64ba51f04579b3266bfdba47ac9362
https://doi.org/10.1007/s10910-021-01219-5
https://doi.org/10.1007/s10910-021-01219-5
Publikováno v:
Discrete Applied Mathematics. 263:244-256
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in circular-arc graphs,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22dc5700c8aae23d08b79c4bc5b6c644
https://doi.org/10.1016/j.dam.2018.01.011
https://doi.org/10.1016/j.dam.2018.01.011
Autor:
Alberto Fleitas, Ricardo Abreu-Blaya, Rosalío Reyes, Juan E. Nápoles Valdés, José M. Rodríguez, José M. Sigarreta
Publikováno v:
Mathematical Methods in the Applied Sciences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d3f1171a2951e78055ea06c619e0df8
https://doi.org/10.1002/mma.6180
https://doi.org/10.1002/mma.6180
Publikováno v:
Discrete Mathematics. 343:112094
If k ≥ 1 and G = ( V , E ) is a finite connected graph, S ⊆ V is said a distance k -dominating set if every vertex v ∈ V is within distance k from some vertex of S . The distance k -domination number γ w k ( G ) is the minimum cardinality amon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::941570e7a47f96120233cbee857382c0
https://doi.org/10.1016/j.disc.2020.112094
https://doi.org/10.1016/j.disc.2020.112094
Publikováno v:
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
instname
Symmetry, Vol 10, Iss 9, p 360 (2018)
Symmetry; Volume 10; Issue 9; Pages: 360
instname
Symmetry, Vol 10, Iss 9, p 360 (2018)
Symmetry; Volume 10; Issue 9; Pages: 360
A graph operator is a mapping F : Gamma → Gamma 0 , where Gamma and Gamma 0 are families of graphs. The different kinds of graph operators are an important topic in Discrete Mathematics and its applications. The symmetry of this operations allows u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1295501752be08064a27bf6cb236b7c
https://doi.org/10.3390/sym10090360
https://doi.org/10.3390/sym10090360
Publikováno v:
Discrete Mathematics Letters, Vol 11, Pp 99-110 (2023)
Externí odkaz:
https://doaj.org/article/90e5d409247f415c9dedbb3f4ddf721f
Publikováno v:
Symmetry; Volume 9; Issue 11; Pages: 255
Symmetry, Vol 9, Iss 11, p 255 (2017)
Symmetry, Vol 9, Iss 11, p 255 (2017)
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. In particular, we are interested in interval and indifference graphs, which are important classes of intersection and Eucl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c993ceac51df853c9bed786ff16a8fb
https://doi.org/10.3390/sym9110255
https://doi.org/10.3390/sym9110255