Join graphs of trees
Bohdan Zelinka (1980)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “On the multiplicity of Laplacian eigenvalues of graphs”
Join graphs of trees
On tree-complete graphs
Ladislav Nebeský (1975)
Časopis pro pěstování matematiky
Similarity:
The star is the tree with greatest greatest Laplacian eigenvalue
Ivan Gutman (2002)
Kragujevac Journal of Mathematics
Similarity:
Extended trees of graphs
Bohdan Zelinka (1994)
Mathematica Bohemica
Similarity:
An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.
One-two descriptor of graphs
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
The third smallest eigenvalue of the Laplacian matrix.
Pati, Sukanta (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity: