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

Das, Kinkar C.; Cevik, Ahmet S.; Cangul, Ismail N.

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:14497</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Let G be a simple connected graph of order n, m edges, maximum degree Delta(1) and minimum degree delta. Li et al. (Appl. Math. Lett. 23: 286-290, 2010) gave an upper bound on number of spanning trees of a graph in terms of n, m, Delta(1) and delta:</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">Das, Kinkar C.</subfield>
    <subfield code="u">Sungkyunkwan Univ, Dept Math, Suwon 440746, South Korea</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:57c075d6a322f3692669ef80aaaca846</subfield>
    <subfield code="s">122</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/14497/files/bib-5c886544-a866-43f8-b2cd-a8c199d75679.txt</subfield>
  </datafield>
  <controlfield tag="005">20210315082121.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2013-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1186/1029-242X-2013-395</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">The number of spanning trees of a graph</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">JOURNAL OF INEQUALITIES AND APPLICATIONS</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">Cevik, Ahmet S.</subfield>
    <subfield code="u">Selcuk Univ, Fac Sci, Dept Math, TR-42075 Campus, Konya, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Cangul, Ismail N.</subfield>
    <subfield code="u">Uludag Univ, Fac Arts &amp; Sci, Dept Math, TR-16059 Bursa, Turkey</subfield>
  </datafield>
  <controlfield tag="001">14497</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>