Year: 2025
Type: article
Abstract: Let G=(V,E) be a connected graph, where V is the set of vertices and E is the set of edges of G. The kite graph, denoted by Kiten,m, is a graph obtained by appending a complete graph Kn to a pendant vertex of path Pm. This research investigates the spectrum of antiadjacency matrix of kite graph. The antiadjacency matrix of a graph G of order n is a square matrix with order n where the entries of the matrix represent the nonadjacency of the vertices.
Institution: University of Indonesia
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4406609487
