We provide a simple method for computing Kemeny’s constant of 1-separable graphs via methods of electrical network theory. Using this method, we show that the path graph on n vertices maximizes Kemeny’s constant for the class of undirected trees of order n and simplify existing expressions for Kemeny’s constant of barbell graphs. We conclude by creating sufficient conditions for the existence of Braess edges in 1-separable graphs.