<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01444nam a22001937a 4500</leader>
  <controlfield tag="005">20240205115629.0</controlfield>
  <controlfield tag="008">240205b           ||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="022" ind1=" " ind2=" ">
    <subfield code="a">0019-5588</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Rather, Bilal Ahmad  </subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">On Schatten p-norm of the distance matrices of graphs (Journal Article)</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New Delhi</subfield>
    <subfield code="b">:Indian National Science Academy | Springer</subfield>
    <subfield code="c">,2023</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">10112-1024p.</subfield>
  </datafield>
  <datafield tag="440" ind1=" " ind2=" ">
    <subfield code="a">Indian Journal of Pure and Applied Mathematics</subfield>
    <subfield code="v">, Volume 54: Number 4, December 2023</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">***______{For Hard Copy, Please visit Library.}________***


</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Abstract: For a connected simple graph G, the generalized distance matrix is defined by, where Tr(G) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix. For particular values of 
, we obtain the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix and other uncountable distance based matrices. Let be the eigenvalues of G and a real number, the Schatten p-norm is the p-th root of the sum of p-th powers of eigenvalues of, that is. In this paper, we obtain various bounds for in terms of different graph parameters and characterize the corresponding extremal graphs.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Distance matrix| Distance Laplacian matrix| Distance Signless Laplacian matrix| D matrix| Schatten p-norm| Ky Fan k norm</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">https://doi.org/10.1007/s13226-022-00317-7</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">PER</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RIEBPL</subfield>
    <subfield code="b">RIEBPL</subfield>
    <subfield code="d">2024-02-05</subfield>
    <subfield code="l">0</subfield>
    <subfield code="r">2024-02-05 00:00:00</subfield>
    <subfield code="w">2024-02-05</subfield>
    <subfield code="y">PER</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">45407</subfield>
    <subfield code="d">45406</subfield>
  </datafield>
</record>
