10 problems

Resistance-distance conjecture. The resistance distance is bounded above by the directed distance:

Let $G$ be a connected graph on $n\geq 3$ vertices. For each vertex $v_i$, let $\kappa_i$ be its resistance curvature, defined by the unique solution $\kappa$ of … where $R_G$ is t…

Let a family of graphs have Laplacian matrices, and apply the procedures LaplaceExpand and SystemReduce together with the mathematical theorems described in the source. The numerat…

Let $T_n$ be the triangular grid graph shown in Figure, with $n$ rows and $m=n^2$ cells. Let $a$ and $b$ be distinct vertices of degree $2$, and let $r_n(a,b)$ be the resistance di…

Let $G=P_n\square P_n$ be the $n\times n$ grid graph with $n^2$ vertices, and let $H=P_{n+1}\square P_{n+1}$ be the $(n+1)\times(n+1)$ grid graph with $(n+1)^2$ vertices. Let…

Let $G$ be the block tower graph $C_4\square P_n$, the Cartesian product of the $4$-cycle and the path of length $n$, with $4n$ vertices, and let $H$ be the block tower graph…

Let $G$ be the straight linear $K$-tree with $n$ vertices and parameter $k\geq 1$, and let $H$ be the straight linear $K$-tree with $n+1$ vertices. Write $r_G(u,v)$ for the resista…

Kirchhoff-index ordering conjecture. For $\alpha\in\{-1,1\}$,

Let $G$ be a linear 2-tree, and let its diameter tend to infinity. Let the maximal resistance distance of $G$ mean the maximum of $r_G(u,v)$ over pairs of vertices. Unbounded resis…

Let $G$ be the straight linear $k$-tree with $k\geq 1$ and $n$ vertices, and let $H$ be the straight linear $k$-tree with $n+1$ vertices. Let $r_G$ and $r_H$ denote resistance dist…