{
  "id": "1404.6419",
  "version": "v1",
  "published": "2014-04-25T13:57:03.000Z",
  "updated": "2014-04-25T13:57:03.000Z",
  "title": "On some numerical characteristics of a bipartite graph",
  "authors": [
    "Krasimir Yordzhev"
  ],
  "journal": "Mathematics and Education in Mathematics, Proceedings of the Forty Third Spring Conference of the Union of Bulgarian Mathematicians, Borovetz, April 2-6, 2014",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these characteristics of the set of all bipartite graphs of the type $g=\\langle R_g \\cup C_g, E_g \\rangle$ is formulated and proved, where $V=R_g \\cup C_g$ is the set of vertices, $E_g$ is the set of edges of the graph $g$, $ |R_g |=m\\ge 1$, $|C_g |= n\\ge 1$, $|E_g |=k\\ge 0$, $m,n$ and $k$ are integers.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-04-25T13:57:03.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C30"
    ],
    "keywords": [
      "bipartite graph",
      "numerical characteristics",
      "equivalence relation",
      "equivalence classes",
      "combinatorial identity"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1404.6419Y"
    }
  }
}