'On the signless Laplacian spectra of $k$-trees'-- CORRIGENDUM

TL;DR

This paper introduces a new method to accurately identify the top three $k$-trees with the largest signless Laplacian spectra among all $n$-vertex $k$-trees.

Contribution

It presents a novel and correct approach for determining extremal $k$-trees based on their signless Laplacian spectra.

Findings

Identified the $k$-trees with the top three largest signless Laplacian indices.

Provided a corrected methodology for spectral analysis of $k$-trees.

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.