论文部分内容阅读
We establish a relation between the number of semi-edge walks of a connected graph and the number of walks of two auxiliary graphs. In addition, this relation gives upper bounds on the signless Laplacian spectral radius of connected graphs and planar grap