Let G be a non-trivial finite group, S ⊆ G \ {e} be a set such that if a ϵ S, then a⁻¹ ϵ S and e be the identity element of G. Suppose that Cay(G, S) is the Cayley graph with the vertex set G such ...

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...

First, we show that the determinant of a given matrix can be expanded by its principal minors together with a set of arbitrary parameters. The enumeration of Hamiltonian cycles and paths in a graph is ...