User profiles for Gabriela Pardo
Gabriela Araujo-PardoMathematics Institute, Universidad Nacional Autónoma de México Verified email at math.unam.mx Cited by 574 |
Acute kidney damage by PM2. 5 exposure in a rat model
OG Aztatzi-Aguilar, GA Pardo-Osorio… - Environmental …, 2021 - Elsevier
PM 2.5 exposure is associated with a glomerular filtration rate (GFR) reduction, and renal
tissue damage. The goal of this study was demonstrate the acute effect of PM 2.5 on the kidney…
tissue damage. The goal of this study was demonstrate the acute effect of PM 2.5 on the kidney…
[PDF][PDF] Finite Geometry
GA Pardo, J Ruff - 8th Slovenian Conference on Graph Theory, 2015 - 93.187.165.126
In this paper we study these two parameters for the complete graph Kn. First, we prove that,
when q is a power of 2 and n= q2+ q+ 1, the pseudoachromatic index ψ (Kn) of the complete …
when q is a power of 2 and n= q2+ q+ 1, the pseudoachromatic index ψ (Kn) of the complete …
[PDF][PDF] The Erdos-Faber-Lovasz Conjecture and a certain n-edge coloring of the complete graph Kn
A VazquezAvila, GA Pardo - j, for - researchgate.net
A hypergraph is linear if any two different edges intersect in at most one vertex. The Erdos-Faber-Lovasz
Conjecture may be stated as follow: Any linear hypergraph H consisting of n …
Conjecture may be stated as follow: Any linear hypergraph H consisting of n …
Evaluation of incontinence and quality of life in patiens with chronic obstructive pulmonary disease (COPD) and bronchiectasis
C Brockwell, A Clark, A Baker, B Hicken, G Pardo… - 2011 - Eur Respiratory Soc
Background: Incontinence is common and more prevalent in respiratory disease. Despite this,
the effect of incontinence on quality of life in respiratory patients is unknown. Methods: We …
the effect of incontinence on quality of life in respiratory patients is unknown. Methods: We …
Time Optimization for Laser Sailing Races
G Pardo Arteaga - 2019 - repository.tudelft.nl
Sailing against the wind follows a zig-zag trajectory. To find the optimal time and path-trajectory
to move from one target to another during a race, this study analyzes how the wind …
to move from one target to another during a race, this study analyzes how the wind …
Edge-girth-regular graphs arising from biaffine planes and Suzuki groups
G Araujo-Pardo, D Leemans - Discrete Mathematics, 2022 - Elsevier
An edge-girth-regular graph e g r ( v , k , g , λ ) , is a k-regular graph of order v, girth g and with
the property that each of its edges is contained in exactly λ distinct g-cycles. An e g r ( v , k …
the property that each of its edges is contained in exactly λ distinct g-cycles. An e g r ( v , k …
On extremal (almost) edge-girth-regular graphs
A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each
of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called …
of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called …
On a relation between bipartite biregular cages, block designs and generalized polygons
G Araujo‐Pardo, R Jajcay… - Journal of …, 2022 - Wiley Online Library
A bipartite biregular ( m , n ; g ) $(m,n;g)$ ‐graph Γ ${\rm{\Gamma }}$ is a bipartite graph of
even girth g $g$ having the degree set { m , n } $\{m,n\}$ and satisfying the additional property …
even girth g $g$ having the degree set { m , n } $\{m,n\}$ and satisfying the additional property …
[HTML][HTML] On transversal and 2-packing numbers in uniform linear systems
CA Alfaro, G Araujo-Pardo… - … Journal of Graphs …, 2020 - Taylor & Francis
A linear system is a pair ( P , L ) where L is a family of subsets on a ground finite set P , such
that | l ∩ l ′ | ≤ 1 , for every l , l ′ ∈ L . The elements of P and L are called points and lines…
that | l ∩ l ′ | ≤ 1 , for every l , l ′ ∈ L . The elements of P and L are called points and lines…
[HTML][HTML] Small bi-regular graphs of even girth
G Araujo-Pardo, G Exoo, R Jajcay - Discrete Mathematics, 2016 - Elsevier
A graph of girth g that contains vertices of degrees r and m is called a bi-regular ( { r , m } , g
) -graph. As with the Cage Problem, we seek the smallest ( { r , m } , g ) -graphs for given …
) -graph. As with the Cage Problem, we seek the smallest ( { r , m } , g ) -graphs for given …