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

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

Citation Style Language JSON

{
  "DOI": "10.1186/1029-242X-2013-395", 
  "abstract": "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:", 
  "author": [
    {
      "family": "Das", 
      "given": " Kinkar C."
    }, 
    {
      "family": "Cevik", 
      "given": " Ahmet S."
    }, 
    {
      "family": "Cangul", 
      "given": " Ismail N."
    }
  ], 
  "container_title": "JOURNAL OF INEQUALITIES AND APPLICATIONS", 
  "id": "14497", 
  "issued": {
    "date-parts": [
      [
        2013, 
        1, 
        1
      ]
    ]
  }, 
  "title": "The number of spanning trees of a graph", 
  "type": "article-journal"
}