Zobrazeno 1 - 6
of 6
pro vyhledávání: '"C. Mahesh kumar"'
Publikováno v:
Boletim da Sociedade Paranaense de Matemática, Vol 40 (2022)
In this article, we derive new modular relations on Ramanujan's product of theta-functions $\phi(q)$ and $f(-q^2)$, which is analogous to Ramanujan's remarkable product of theta-functions and their explicit evaluations.
Externí odkaz:
https://doaj.org/article/e8b16ea72bd04bb181f5d1a754a2ec15
Publikováno v:
Materials Today: Proceedings. 45:2239-2247
A roll cage is a structural framework of an All-Terrain Vehicle (ATV) which provides three-dimensional protection to the driver in case of sudden impact or rollover accidents and also to mount the various subsystems of the vehicle. Engineering world
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::446573085af44938431d1b9222a7e78c
https://doi.org/10.1016/j.matpr.2020.10.224
https://doi.org/10.1016/j.matpr.2020.10.224
Autor:
H. M. Nagesh, Humanities, Pes University-Electronic City Campus, Hosur Road , Bangalore , India, M. C. Mahesh Kumar
Publikováno v:
Engineering and Applied Science Letters, Vol 1, Iss 1, Pp 29-42 (2018)
For an arborescence \(A_r\), a directed pathos total digraph \(Q=DPT(A_r)\) has vertex set \(V(Q)=V(A_r)∪A(A_r)∪P(A_r)\), where \(V(A_r)\) is the vertex set, \(A(A_r)\) is the arc set, and \(P(A_r)\) is a directed pathos set of \(A_r\). The arc s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::668a88cebc266ba94869056db8aaa927
https://pisrt.org/psr-press/journals/easl-vol-1-issue-1-2018/directed-pathos-total-digraph-of-an-arborescence/
https://pisrt.org/psr-press/journals/easl-vol-1-issue-1-2018/directed-pathos-total-digraph-of-an-arborescence/
Autor:
Humanities, Pes University-Electronic City Campus, Hosur Road , Bangalore , India, M. C. Mahesh Kumar, H. M. Nagesh
Publikováno v:
Open Journal of Mathematical Sciences, Vol 2, Iss 1, Pp 202-208 (2018)
Let \(D\) be a connected digraph of order \(n\); \((n \geq 3)\) and let \(B(D)=\{B_1,B_2,\ldots,B_N\}\) be a set of blocks of \(D\). The block digraph \(Q=\mathbb{B}(D)\) has vertex set \(V(Q)=B(D)\) and arc set \(A(Q)=B_iB_j\) and \(B_i,B_j \in V(Q)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7138eaf92d300dbe877e6dd31e448c1d
https://doi.org/10.30538/oms2018.0028
https://doi.org/10.30538/oms2018.0028
The path number of a graph G is the number of paths in any pathos. The path number of a tree T equals k, where 2k is the number of odd degree vertices of T Harary and Stanton calculated the path number of certain classes of graphs like trees and comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e471ef93f647e432c8081720cd2429fa
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.