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

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

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 14497, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Sungkyunkwan Univ, Dept Math, Suwon 440746, South Korea", 
      "name": "Das, Kinkar C."
    }, 
    {
      "@type": "Person", 
      "affiliation": "Selcuk Univ, Fac Sci, Dept Math, TR-42075 Campus, Konya, Turkey", 
      "name": "Cevik, Ahmet S."
    }, 
    {
      "@type": "Person", 
      "affiliation": "Uludag Univ, Fac Arts & Sci, Dept Math, TR-16059 Bursa, Turkey", 
      "name": "Cangul, Ismail N."
    }
  ], 
  "datePublished": "2013-01-01", 
  "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:", 
  "headline": "The number of spanning trees of a graph", 
  "identifier": 14497, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "The number of spanning trees of a graph", 
  "url": "https://aperta.ulakbim.gov.tr/record/14497"
}