{
  "id": "1404.7286",
  "version": "v1",
  "published": "2014-04-29T09:25:55.000Z",
  "updated": "2014-04-29T09:25:55.000Z",
  "title": "The spectral radius of the square of graphs",
  "authors": [
    "Yi-Zheng Fan",
    "Long Wang"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and unicyclic graphs respectively.We also investigate the spectral radius of the square of unicyclic graphs with given girth or trees with fixed diameter.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-04-29T09:25:55.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50"
    ],
    "keywords": [
      "spectral radius",
      "connected graph",
      "lower bounds",
      "unicyclic graphs",
      "fixed diameter"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1404.7286F"
    }
  }
}