A LAPLACIAN ALGEBRAIC CHARACTERIZATION IN SOME CLASSES OF COMPLETE TRIPARTITE GRAPHS

Vol 56, 2024 - 309804
Poster formatting rules (PS)
Favorite this paper
How to cite this paper?
Abstract

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.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 UERJ
Track
  • 19. TAG – Graph Theory and Algorithms
Keywords
Graph theory
Complete tripartite graph
Spectral Graph Theory