ALL libraries (COBIB.SI union bibliographic/catalogue database)
13.
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
Brankov, Vladimir ; Hansen, Pierre ; Stevanović, Dragan, 1974-
Several upper bounds on the largest Laplacian eigenvalue of a graph ▫$G$▫, in terms of degree and average degree of neighbors of its vertices, have been proposed in the literature.We showthat all ...these bounds, as well as many conjectured new ones, can be generated systematically using some simple algebraic manipulations. Bounds depending on the edges of ▫$G$▫ are also generated. Moreover, the interestingness of bounds is discussed, in terms of dominance and tightness. Finally, we give a unified way of proving a sample of these bounds.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
