'On the signless Laplacian spectra of k-trees'-- CORRIGENDUM
classification
🧮 math.CO
keywords
laplaciansignlesstreescorrectcorrigendumdeterminefirstindices
read the original abstract
In this paper, we use a new and correct method to determine the $n$-vertex $k$-trees with the first three largest signless Laplacian indices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.