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

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

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Das, Kinkar C.</dc:creator>
  <dc:creator>Cevik, Ahmet S.</dc:creator>
  <dc:creator>Cangul, Ismail N.</dc:creator>
  <dc:date>2013-01-01</dc:date>
  <dc:description>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:</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/14497</dc:identifier>
  <dc:identifier>oai:zenodo.org:14497</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>JOURNAL OF INEQUALITIES AND APPLICATIONS</dc:source>
  <dc:title>The number of spanning trees of a graph</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>