A Study of the Energy and Spectral Characteristics of the Knight’s Hypergraph

HAL 2026

Authors: N Santhosh Kumar, P. Suma, Jasmine Mathew
Cited by: 0

Abstract

Hypergraphs are generalization of graphs, introduced by Berge. In an ordinary graph, an edge connects exactly two vertices, whereas in hypergraphs, a hyperedge can join any number of vertices. Hypergraphs have applications in the field of Computer Science, Machine learning, Neural networks etc . In this paper, we focus on the Knight’s hypergraph in which the squares of a chessboard are taken as vertices and each hyperedge include a vertex and all the vertices which are reachable by a knight in one move. We find the Adjacency matrix, Laplacian matrix, their eigenvalues and corresponding energies of the Knight’s hypergraph with the help of Python programming.

Fields of Study & Subjects

Graph theory and applications Limits and Structures in Graph Theory Graph Theory and Algorithms

Publication details

Journal / source
HAL
Volume
22
Issue
2
Pages
20–31
Publication date
6 February 2026
Language
EN