ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Springer
    Acta mathematicae applicatae sinica 11 (1995), S. 69-78 
    ISSN: 1618-3932
    Keywords: Bandwidth sum of a graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a graphG=(V,E) of orderp, a 1−1 mappingf:V→{1,2,...,p} is called a labelling ofG. B sum(G)=min f {Σ(u,v)∉E |f(u)−f(v)|:f is a labelling ofG} is called the bandwidth sum ofG. In this paper, some lower bounds and upper bounds of bandwidth sums of graphs are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...