To cite this paper use one of the standards below:
Given a simple graph $G$ with $n$ vertices, a graph is $k$-partite if its vertices can be partitioned into $k$ parts, where any vertices in the same part are non-adjacent to each other. A graph is $k$-partite complete if there is an edge between all pairs of vertices that are in different parts. In the case where $k = 3$, the graph is known as complete tripartite. The characteristic polynomial of the adjacency matrix $A$ of a graph is denoted by $p_G=det(A-\lambda Id_n)$, it is known as the characteristic polynomial of the graph. Its roots are the eigenvalues of the matrix. The Laplacian matrix $L_{nxn}$ of a graph is defined by $L = D - A$, where $D$ is the degree matrix of the graph. This work presents the spectral characterization of the Laplacian matrix of the complete tripartite graph, more specifically the subclasses $K_{1,1,i}$, $K_{1,2,i}$ and $K_{2,2,i}$ for $i\geq 1$. The characteristic polynomials and eigenvalues for $i = {1, 2, \dots, 10}$ of the subclasses subclasses $K_{1,1,i}$, $K_{1,2,i}$ and $K_{2,2,i}$ for $i\geq 1$ are presented, as well as the structural characterization of these subclasses under the aspect of the Laplacian matrix.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper