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

Bozkurt, S. Burcu; Bozkurt, Durmus

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/62001</identifier>
  <creators>
    <creator>
      <creatorName>Bozkurt, S. Burcu</creatorName>
      <givenName>S. Burcu</givenName>
      <familyName>Bozkurt</familyName>
      <affiliation>Selcuk Univ, Fac Sci, Dept Math, TR-42075 Konya, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Bozkurt, Durmus</creatorName>
      <givenName>Durmus</givenName>
      <familyName>Bozkurt</familyName>
      <affiliation>Selcuk Univ, Fac Sci, Dept Math, TR-42075 Konya, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>On The Number Of Spanning Trees Of Graphs</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2014</publicationYear>
  <dates>
    <date dateType="Issued">2014-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/62001</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1155/2014/294038</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">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).</description>
  </descriptions>
</resource>