PreprintarXiv licencearXiv
On some structural properties of graphs with non-negative resistance curvature
Abstract
A graph is called resistance nonnegative (RN), respectively resistance positive (RP), if it admits positive edge weights such that all vertex resistance curvatures are nonnegative, respectively positive. In this paper, we study the structure of RN and RP graphs in relation to toughness, traceability, and Cartesian products. First, we disprove a conjecture of Fiedler and answer a question of Devriendt in the negative by constructing, for every n≥ 11, an n-vertex $1$-tough graph that is not RN. Second, we show that RP graphs need not be traceable by proving that the Thomassen $34$-graph is RP but not traceable. Finally, we resolve a conjecture of Devriendt on grid graphs by proving that all Cartesian products of paths are RN.
Related
- Torus actions, almost non-negative curvature and fundamental groups
- Restriction estimates for surfaces with negative curvature in ℝ3
- A remark on the compactness of manifolds with non-negative Ricci curvature and uniformly convex boundary
- Maximal symmetry rank and almost non-negative curvature in low dimensions
- Positivity of the canonical bundle and Hermitian metrics with quasi-negative holomorphic sectional curvature
BibTeX
@misc{agrahari2026some,
title = {{On some structural properties of graphs with non-negative resistance curvature}},
author = {Gyaneshwar Agrahari and Christin Bibby and Sean Boros and Hailey Jay Garcia and Fernando Heidercheidt and Zhiyu Wang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.13169},
eprint = {2607.13169},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.13169},
}
RIS
TY - UNPB
TI - On some structural properties of graphs with non-negative resistance curvature
AU - Gyaneshwar Agrahari
AU - Christin Bibby
AU - Sean Boros
AU - Hailey Jay Garcia
AU - Fernando Heidercheidt
AU - Zhiyu Wang
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2607.13169
UR - https://arxiv.org/abs/2607.13169
AB - A graph is called resistance nonnegative (RN), respectively resistance positive (RP), if it admits positive edge weights such that all vertex resistance curvatures are nonnegative, respectively positive. In this paper, we study the structure of RN and RP graphs in relation to toughness, traceability, and Cartesian products. First, we disprove a conjecture of Fiedler and answer a question of Devriendt in the negative by constructing, for every n≥ 11, an n-vertex $1$-tough graph that is not RN. Second, we show that RP graphs need not be traceable by proving that the Thomassen $34$-graph is RP but not traceable. Finally, we resolve a conjecture of Devriendt on grid graphs by proving that all Cartesian products of paths are RN.
ER -