ISSN 0253-2778

CN 34-1054/N

open

The Erdo″s-So′s conjecture for 2-center spiders

    Abstract
  • The Erdo″s-So′s Conjecture states that if G is a graph with average degree more than k-2, then G contains every tree on k vertices. A spider can be seen as a tree with at most one vertex of degree more than two. Fan, Hong, and Liu proved that the conjecture holds for spiders.
    • FullText(HTML)
  • loading
    • References (11)
    • Related Articles
  • Track Citations

Catalog

    Get Citation
    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML
    TrendMD

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return