Zobrazeno 1 - 10
of 2 001
pro vyhledávání: '"M., Rajesh"'
In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices. In this article, we describe how the idea of unfolding a bipartite
Externí odkaz:
http://arxiv.org/abs/2401.03035
Autor:
Kumar, Ashwina, Krishna, M. Venkata, Bartakke, Prasanna, Kumar, Rahul, M, Rajesh Pandian, Behera, Nibedita, Nasre, Rupesh
Sparse graphs are ubiquitous in real and virtual worlds. With the phenomenal growth in semi-structured and unstructured data, sizes of the underlying graphs have witnessed a rapid growth over the years. Analyzing such large structures necessitates pa
Externí odkaz:
http://arxiv.org/abs/2401.02472
Autor:
Samanta, Aniruddha, Kannan, M. Rajesh
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the gain function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite orientation.
Externí odkaz:
http://arxiv.org/abs/2312.17152
Autor:
Al-Ali, Afnan, Al-Maadeed, Somaya, Saleh, Moutaz, Naidu, Rani Chinnappa, Alex, Zachariah C, Ramachandran, Prakash, Khoodeeram, Rajeev, M, Rajesh Kumar
Dysarthria is a neurological speech disorder that can significantly impact affected individuals' communication abilities and overall quality of life. The accurate and objective classification of dysarthria and the determination of its severity are cr
Externí odkaz:
http://arxiv.org/abs/2310.07264
Autor:
Mahato, Iswar, Kannan, M. Rajesh
In this article, we show that the generalized tree shift operation increases the distance spectral radius, distance signless Laplacian spectral radius, and the $D_\alpha$-spectral radius of complements of trees. As a consequence of this result, we co
Externí odkaz:
http://arxiv.org/abs/2306.05155
Autor:
Behera, Nibedita, Kumar, Ashwina, T, Ebenezer Rajadurai, Nitish, Sai, M, Rajesh Pandian, Nasre, Rupesh
Graphs model several real-world phenomena. With the growth of unstructured and semi-structured data, parallelization of graph algorithms is inevitable. Unfortunately, due to inherent irregularity of computation, memory access, and communication, grap
Externí odkaz:
http://arxiv.org/abs/2305.03317
Autor:
Mahato, Iswar, Kannan, M. Rajesh
The eccentricity matrix of a connected graph $G$, denoted by $\mathcal{E}(G)$, is obtained from the distance matrix of $G$ by keeping the largest nonzero entries in each row and each column, and leaving zeros in the remaining ones. The $\mathcal{E}$-
Externí odkaz:
http://arxiv.org/abs/2301.01708
Publikováno v:
Journal of Nigerian Society of Physical Sciences, Vol 6, Iss 4 (2024)
This study proposes a two-dimensional, eight-noded automated mesh generator for precise and efficient finite element analysis (FEA) in microwave applications. The suggested method for solving the Helmholtz problem employs an optimal domain discretiza
Externí odkaz:
https://doaj.org/article/202f6a9659e0440fb6554a59b0232c3b
Autor:
Ibrahim Alqahtani, B. Niyaz Ahmed, E. Ashoka, A. M. Rajesh, P. B. Bharath, Doddamani Saleemsab
Publikováno v:
Frattura ed Integrità Strutturale, Vol 19, Iss 71 (2024)
In the field of composite materials, extensive research has been undertaken on aluminum-graphite composites. However, a research gap has been identified regarding the specific influence of nano-sized graphite particles on their fracture toughness. Pr
Externí odkaz:
https://doaj.org/article/a6009736a41a4ebaab2943088ae49c45
Autor:
Mahato, Iswar, Kannan, M. Rajesh
The eccentricity matrix of a connected graph $G$, denoted by $\mathcal{E}(G)$, is obtained from the distance matrix of $G$ by keeping the largest nonzero entries in each row and each column and leaving zeros in the remaining ones. The eigenvalues of
Externí odkaz:
http://arxiv.org/abs/2208.13462