In this paper, we study the resistance Laplacian and the resistance signless Laplacian matrix associated with a connected graph. We provide the general form of these matrices for various types of graphs, including complete graphs, complete bipartite graphs, and cycles. We investigate their spectral characteristics, det...
S. Parab, Raisa Dsouza· Rendiconti del Circolo Matem...· 1 citation
A \(\mathbb{T}\)-gain digraph is a directed graph with complex unit gains on its arcs, allowing for no restrictions on oppositely directed arcs. This framework unifies various graph types, such as signed graphs, mixed graphs, complex unit gain graphs, digraphs, and signed digraphs. The gain adjacency, Laplacian, and si...
S. Parab, Tarkeshwar Singh, M. Nagar· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.