ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Graphs with prescribed degree sets and girth (1981)
    Springer
    Periodica mathematica Hungarica 12 (1981), S. 261-266 
    Details
    ISSN: 1588-2829
    Keywords: Primary 05C38 ; Secondary 05C35 ; (r, n)-cage ; complete bipartite graph ; n-cycle ; degree set ; girth ; order of a graph ; vertex
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a finite nonempty set of integers, each of which is at least two, and an integern ≥ 3, the numberf( ;n) is defined as the least order of a graph having degree set and girthn. The numberf( ;n) is evaluated for several sets and integersn. In particular, it is shown thatf({3, 4}; 5) = 13 andf({3, 4}; 6) = 18.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01849614
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...