"Laplacian matrix" meaning in English

{
  "etymology_text": "Named after Pierre-Simon, marquis de Laplace (1749 – 1827), a French scholar whose work was important to the development of mathematics, statistics, physics and astronomy.",
  "forms": [
    {
      "form": "Laplacian matrices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "Laplacian matrices"
      },
      "expansion": "Laplacian matrix (plural Laplacian matrices)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A square n×n matrix which describes an undirected graph of n vertices by letting rows and columns correspond to vertices, letting its diagonal elements contain the degrees of corresponding vertices and letting its non-diagonal elements contain either −1 or 0 depending on whether there is or there is not (respectively) an edge connecting the pair of corresponding vertices."
      ],
      "id": "en-Laplacian_matrix-en-noun-u8Kh8Cj3",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "degree",
          "degree"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A square n×n matrix which describes an undirected graph of n vertices by letting rows and columns correspond to vertices, letting its diagonal elements contain the degrees of corresponding vertices and letting its non-diagonal elements contain either −1 or 0 depending on whether there is or there is not (respectively) an edge connecting the pair of corresponding vertices."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Laplacian matrix",
        "Pierre-Simon Laplace"
      ]
    }
  ],
  "word": "Laplacian matrix"
}

{
  "etymology_text": "Named after Pierre-Simon, marquis de Laplace (1749 – 1827), a French scholar whose work was important to the development of mathematics, statistics, physics and astronomy.",
  "forms": [
    {
      "form": "Laplacian matrices",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "Laplacian matrices"
      },
      "expansion": "Laplacian matrix (plural Laplacian matrices)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A square n×n matrix which describes an undirected graph of n vertices by letting rows and columns correspond to vertices, letting its diagonal elements contain the degrees of corresponding vertices and letting its non-diagonal elements contain either −1 or 0 depending on whether there is or there is not (respectively) an edge connecting the pair of corresponding vertices."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "degree",
          "degree"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A square n×n matrix which describes an undirected graph of n vertices by letting rows and columns correspond to vertices, letting its diagonal elements contain the degrees of corresponding vertices and letting its non-diagonal elements contain either −1 or 0 depending on whether there is or there is not (respectively) an edge connecting the pair of corresponding vertices."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Laplacian matrix",
        "Pierre-Simon Laplace"
      ]
    }
  ],
  "word": "Laplacian matrix"
}