Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Rigoberto Flórez"'
Autor:
Josephine Brooks, Alvaro Carbonero, Joseph Vargas, Rigoberto Flórez, Brendan Rooney, Darren A. Narayan
Publikováno v:
Mathematics, Vol 11, Iss 6, p 1322 (2023)
A vertex in a graph is referred to as fixed if it is mapped to itself under every automorphism of the vertices. The fixing number of a graph is the minimum number of vertices, when fixed, that fixes all of the vertices in the graph. Fixing numbers we
Externí odkaz:
https://doaj.org/article/2e3586b5e437416a9628dd34594f3050
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 265-300 (2020)
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform. I
Externí odkaz:
https://doaj.org/article/5836849bde7947ea9ed7f15fd3985a96
Autor:
Alejandra Brewer, Adam Gregory, Quindel Jones, Luke Rodriguez, Rigoberto Flórez, Darren Narayan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 1000-1009 (2020)
A graph G is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability of a graph on n vertices being asymmetric tends to 1 as n tends to infinity. In
Externí odkaz:
https://doaj.org/article/c0291ec4c73543339c34cf9384a8328d
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 3, Pp 295-306 (2017)
In 2010, Joyce et al. defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to the degrees of all it neighbors. We investigate this
Externí odkaz:
https://doaj.org/article/eaabf343f2d745b0a9ddbac03649df67
Autor:
Josephine Brooks, Alvaro Carbonero, Joseph Vargas, Rigoberto Flórez, Brendan Rooney, Darren Narayan
Publikováno v:
Mathematics, Vol 9, Iss 2, p 166 (2021)
An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex v in a graph G is fixed if it is mapped to itself under every automorphism of G. The fixing number of a gra
Externí odkaz:
https://doaj.org/article/1cc32c23abd94892809d582d3d3bde1b
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 38-53 (2016)
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of G is define
Externí odkaz:
https://doaj.org/article/b42509a91f8b4a9c8e29e3d565a2d3f3
Autor:
Rigoberto Flórez, Darren A. Narayan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 1, Pp 32-39 (2015)
A k-ranking is a vertex k-coloring with positive integers such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is smallest k such that G has a k-ranking. For certain grap
Externí odkaz:
https://doaj.org/article/a8cb4d804fb44b6eb12a0b27e2ce945a
Autor:
Rigoberto Flórez, David Forge
Publikováno v:
Journal of Combinatorial Theory, Series A. 198:105755
The interior and exterior activities of bases of a matroid are well-known notions that for instance permit one to define the Tutte polynomial. Recently, we have discovered correspondences between the regions of gainic hyperplane arrangements and colo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5366dd6579a9f1e49556a2542f919d18
https://doi.org/10.1016/j.jcta.2023.105755
https://doi.org/10.1016/j.jcta.2023.105755
Autor:
José L. Ramírez, Rigoberto Flórez
Publikováno v:
Graphs and Combinatorics. 37:2775-2801
We extend the concept of non-decreasing Dyck paths to t-Dyck paths. We denote the set of non-decreasing t-Dyck paths by $${{\mathcal D}}_t$$ . Several classic questions studied in other families of lattice paths are studied here for $${{\mathcal D}}_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e37bedc1ec8ad53488895fe74f3ed8e2
https://doi.org/10.1007/s00373-021-02392-9
https://doi.org/10.1007/s00373-021-02392-9
Publikováno v:
Special Matrices, Vol 8, Iss 1, Pp 257-273 (2020)
The determinant Hosoya triangle, is a triangular array where the entries are the determinants of two-by-two Fibonacci matrices. The determinant Hosoya triangle mod 2 gives rise to three infinite families of graphs, that are formed by complete product
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ad1fa4925a50057c3640c6f6285dfec
https://doi.org/10.1515/spma-2020-0116
https://doi.org/10.1515/spma-2020-0116