'On the signless Laplacian spectra of k-trees'-- CORRIGENDUM
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.