Tight estimates for eigenvalues of regular graphs.
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
Access Full Article
top
How to cite
topNilli, 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 ?
topYou 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.