Ezequiel Dratman

From MaRDI portal
(Redirected from Ezequiel Dratman)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Determinant, inertia, and inverse of a class of irreducible tridiagonal matrices
Georgian Mathematical Journal
2026-07-17Paper
Commutative distance degree-regular graphs
Discrete Applied Mathematics
2026-03-05Paper
On the spectral radius of unbalanced signed bipartite graphs
Discrete Mathematics
2026-02-16Paper
A Sharp Forbidden Interval for the Nontrivial Adjacency Eigenvalues of Trivially Perfect Graphs
(available as arXiv preprint)
2026-01-01Paper
Formulas and Upper Bounds for the Carathéodory Number of Hamming Graphs
(available as arXiv preprint)
2025-01-01Paper
On the spectral radius of unbalanced signed bipartite graphs
(available as arXiv preprint)
2024-01-01Paper
Singularly cospectral circulant graphs
(available as arXiv preprint)
2024-01-01Paper
Finding singularly cospectral graphs
Linear and Multilinear Algebra
2023-05-10Paper
On the rank of the distance matrix of graphs
Applied Mathematics and Computation
2022-08-05Paper
Computing the determinant of the distance matrix of a bicyclic graph2022-04-27Paper
On the rank of the distance matrix of graphs
(available as arXiv preprint)
2022-03-04Paper
On the spectral radius of block graphs having all their blocks of the same size
Linear Algebra and its Applications
2021-11-25Paper
On the spectral radius of block graphs with prescribed independence number
Linear Algebra and its Applications
2021-02-17Paper
The determinant of the distance matrix of graphs with blocks at most bicyclic
Linear Algebra and its Applications
2021-02-17Paper
On the spectral radius of graphs: nonregular distance-hereditary graphs with given edge-connectivity, graphs with tree-width k and block graphs with prescribed independence number \alpha2019-11-19Paper
Improved bounds for the inverses of diagonally dominant tridiagonal matrices
Linear Algebra and its Applications
2019-07-12Paper
Partial characterization of graphs having a single large Laplacian eigenvalue
The Electronic Journal of Combinatorics
2019-03-05Paper
Partial characterization of graphs having a single large Laplacian eigenvalue
The Electronic Journal of Combinatorics
2019-03-05Paper
On the spectral radius of graphs: nonregular distance-hereditary graphs with given edge-connectivity, graphs with tree-width $k$ and block graphs with prescribed independence number $\alpha$
(available as arXiv preprint)
2019-01-01Paper
On graphs with a single large Laplacian eigenvalue2018-04-09Paper
Newton's method and a mesh-independence principle for certain semilinear boundary-value problems
Journal of Computational and Applied Mathematics
2015-09-09Paper
Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption
Journal of Complexity
2014-02-03Paper
Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with large absorption
Journal of Computational and Applied Mathematics
2012-11-09Paper
Robust algorithms for generalized Pham systems
Computational Complexity
2011-02-18Paper
Approximation of the solution of certain nonlinear ODEs with linear complexity
Journal of Computational and Applied Mathematics
2010-02-12Paper
On the solution of the polynomial systems arising in the discretization of certain ODEs
Computing
2009-09-09Paper
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity
2005-09-02Paper


Research outcomes over time


This page was built for person: Ezequiel Dratman