The path is the tree with smallest greatest Laplacian eigenvalue

Miroslav Petrović; Ivan Gutman

Kragujevac Journal of Mathematics (2002)

  • Volume: 24, Issue: 24, page 67-70
  • ISSN: 1450-9628

How to cite

top

Miroslav Petrović, and Ivan Gutman. "The path is the tree with smallest greatest Laplacian eigenvalue." Kragujevac Journal of Mathematics 24.24 (2002): 67-70. <http://eudml.org/doc/253148>.

@article{MiroslavPetrović2002,
author = {Miroslav Petrović, Ivan Gutman},
journal = {Kragujevac Journal of Mathematics},
keywords = {Laplacian spectrum; largest eigenvalue; smallest largest Laplacian eigenvalue; trees; paths},
language = {eng},
number = {24},
pages = {67-70},
publisher = {Prirodno-matematički fakultet Kragujevac},
title = {The path is the tree with smallest greatest Laplacian eigenvalue},
url = {http://eudml.org/doc/253148},
volume = {24},
year = {2002},
}

TY - JOUR
AU - Miroslav Petrović
AU - Ivan Gutman
TI - The path is the tree with smallest greatest Laplacian eigenvalue
JO - Kragujevac Journal of Mathematics
PY - 2002
PB - Prirodno-matematički fakultet Kragujevac
VL - 24
IS - 24
SP - 67
EP - 70
LA - eng
KW - Laplacian spectrum; largest eigenvalue; smallest largest Laplacian eigenvalue; trees; paths
UR - http://eudml.org/doc/253148
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.