Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Sudhakara G"'
Autor:
Bhat K. Arathi, Sudhakara G.
Publikováno v:
Special Matrices, Vol 6, Iss 1, Pp 343-356 (2018)
In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk )
Externí odkaz:
https://doaj.org/article/40715ad0d20940848d377290e40fd6d8
Publikováno v:
In IFAC PapersOnLine 2022 55(1):528-534
Publikováno v:
In Ain Shams Engineering Journal December 2021 12(4):4119-4124
Publikováno v:
The Journal of the Indian Mathematical Society. :75-84
Chain graphs and threshold graphs are special classes of graphs which have maximum spectral radius among bipartite graphs and connected graphs with given order and size, respectively. In this article, we focus on some of linear algebraic tools like r
Autor:
Bhat, K. Arathi1 arathi.bhat@manipal.edu, Sudhakara, G.1 sudhakara.g@manipal.edu
Publikováno v:
Proyecciones - Journal of Mathematics. Jun2022, Vol. 41 Issue 3, p715-732. 18p.
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.
Publikováno v:
International Journal of Dynamics and Control. 11:271-285
This article investigates mathematical modelling and control of a nonlinear negative imaginary system using an illustrative benchmark physical example of a quadrotor dynamic model. A generalized methodology based on Euler–Lagrange equation is appli
Autor:
Ramesh, B., Sainath, S.B., Karuna, R., Sreenivasa Reddy, S., Manjunatha, B., Sudhakara, G., Sasi Bhusana Rao, B., Saralakumari, D. *
Publikováno v:
In Beni-Suef University Journal of Basic and Applied Sciences December 2015 4(4):269-278
Autor:
JYOTI SHETTY, Sudhakara, G.
Publikováno v:
Scopus-Elsevier
Semigraph is a generalization of graph, with two or more vertices on edges which allows multiplicity in every concept of graph when it comes to semigraph. When number of vertices on the edges are restricted to two the semigraph is a graph, so every g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ed00df84842bb08b2ff66fac553b1312
https://hdl.handle.net/11729/3397
https://hdl.handle.net/11729/3397
Publikováno v:
International Journal of Dynamics & Control; Feb2023, Vol. 11 Issue 1, p271-285, 15p