5 citations · 5 across the 7 of their papers we have counts for
8 papers
On the Spectral Analysis of the Superpower Graph of the Direct Product of Dihedral Groups
Basit Auyoob Mir, Fouzul Atik
The superpower graph of a finite group , or , is an undirected simple graph whose vertices are the elements of the group , and two distinct vertices …
When Are Standard Graph Products Isomorphic?
Priti Prasanna Mondal, M. Rajesh Kannan, Fouzul Atik
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We pro…
On the Spectral Analysis of Power Graph of Dihedral Groups
Basit Auyoob Mir, Fouzul Atik, Priti Prasanna Mondal
The power graph \( \mathcal{G}_G \) of a group \( G \) is a graph whose vertex set is \( G \), and two elements \( x, y \in G \) are adjacent if one is an integral power of the oth…
On the distance spectrum of the Kronecker product of distance regular graphs
Priti Prasanna Mondal, Fouzul Atik
Consider two simple graphs, G1 and G2, with their respective vertex sets V(G1) and V(G2). The Kronecker product forms a new graph with a vertex set V(G1) X V(G2). In this new graph…
Spectral radius and second largest eigenvalues of power graphs of finite groups
Priti Prasanna Mondal, Basit Auyoob Mir, Fouzul Atik
Consider a group and construct its power graph, whose vertex set consists of the elements of . Two distinct vertices (elements) are adjacent in the graph i…
Analysis of Distributed Average Consensus Algorithms for Robust IoT networks
Sateeshkrishna Dhuli, Fouzul Atik
Internet of Things(IoT) is a heterogeneous network consists of various physical objects such as large number of sensors, actuators, RFID tags, smart devices, and servers connected…
Resistance matrices of graphs with matrix weights
Fouzul Atik, Ravindra B Bapat, M. Rajesh Kannan
The \emph{resistance matrix} of a simple connected graph is denoted by , and is defined by , where is the resistance distance between the vertices …
On distance and Laplacian matrices of trees with matrix weights
Fouzul Atik, M. Rajesh Kannan, R. B. Bapat
The \emph{distance matrix} of a simple connected graph is , where is the distance between the vertices and in . We consider a weighted tree $…