1 Ocak 2014 Dergi makalesi Açık Erişim

Bozkurt, S. Burcu; Bozkurt, Durmus

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:zenodo.org:62001</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Delta(1)), minimum vertex degree (delta), first Zagreb index (M-1), and Randic index (R-1).</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Bozkurt, S. Burcu</subfield>
    <subfield code="u">Selcuk Univ, Fac Sci, Dept Math, TR-42075 Konya, Turkey</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:83fc2140a70c7d82cc2d64b71383c1aa</subfield>
    <subfield code="s">102</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/62001/files/bib-876bf10f-6fa6-4720-a9f8-1dc6a4e23e0e.txt</subfield>
  </datafield>
  <controlfield tag="005">20210316012056.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2014-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1155/2014/294038</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">On the Number of Spanning Trees of Graphs</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">SCIENTIFIC WORLD JOURNAL</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Bozkurt, Durmus</subfield>
    <subfield code="u">Selcuk Univ, Fac Sci, Dept Math, TR-42075 Konya, Turkey</subfield>
  </datafield>
  <controlfield tag="001">62001</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>