Tight estimates for eigenvalues of regular graphs.

Nilli, A.

The Electronic Journal of Combinatorics [electronic only] (2004)

  • Volume: 11, Issue: 1, page Research paper N9, 4 p.-Research paper N9, 4 p.
  • ISSN: 1077-8926

How to cite

top

Nilli, A.. "Tight estimates for eigenvalues of regular graphs.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper N9, 4 p.-Research paper N9, 4 p.. <http://eudml.org/doc/124017>.

@article{Nilli2004,
author = {Nilli, A.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {adjacency matrix; eigenvalues},
language = {eng},
number = {1},
pages = {Research paper N9, 4 p.-Research paper N9, 4 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Tight estimates for eigenvalues of regular graphs.},
url = {http://eudml.org/doc/124017},
volume = {11},
year = {2004},
}

TY - JOUR
AU - Nilli, A.
TI - Tight estimates for eigenvalues of regular graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper N9, 4 p.
EP - Research paper N9, 4 p.
LA - eng
KW - adjacency matrix; eigenvalues
UR - http://eudml.org/doc/124017
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.