http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Riemann solitons on $(\kappa, \mu)$-almost cosymplectic manifolds
Prakasha D. Gowda,Devaraja M. Naik,Amruthalakshmi M. Ravindranatha,Venkatesha Venkatesha 대한수학회 2023 대한수학회논문집 Vol.38 No.3
In this paper, we study almost cosymplectic manifolds with nullity distributions admitting Riemann solitons and gradient almost Riemann solitons. First, we consider Riemann soliton on $(\kappa, \mu)$-almost cosymplectic manifold $M$ with $\kappa<0$ and we show that the soliton is expanding with $\lambda = \frac{\kappa}{2n-1}(4n-1)$ and $M$ is locally isometric to the Lie group $G_\rho$. Finally, we prove the non-existence of gradient almost Riemann soliton on a $(\kappa, \mu)$-almost cosymplectic manifold of dimension greater than 3 with $\kappa < 0$.
Minimum Covering Randic Energy of a Graph
Prakasha, Kunkunadu Nanjundappa,Polaepalli, Siva Kota Reddy,Cangul, Ismail Naci Department of Mathematics 2017 Kyungpook mathematical journal Vol.57 No.4
In this paper, we introduce the minimum covering Randic energy of a graph. We compute minimum covering Randic energy of some standard graphs and establish upper and lower bounds for this energy. Also we disprove a conjecture on Randic energy which is proposed by S. Alikhani and N. Ghanbari, [2].
Partition Laplacian energy of a graph
K. N. Prakasha,P.Siva Kota Reddy,Ismail Naci CANGUL 장전수학회 2017 Advanced Studies in Contemporary Mathematics Vol.27 No.4
The partition energy of a graph was introduced by E. Sampathkumar et al. in [19] in 2015. In this paper, by the motivation of this new energy, the partition Laplacian energy LEp(G) of a graph is introduced and the LEp(G) of some important graph classes is discussed. Also, we obtain some bounds for the partition Laplacian energy.
h-almost Ricci Solitons on Generalized Sasakian-space-forms
Doddabhadrappla Gowda, Prakasha,Amruthalakshmi Malleshrao, Ravindranatha,Sudhakar Kumar, Chaubey,Pundikala, Veeresha,Young Jin, Suh Department of Mathematics 2022 Kyungpook mathematical journal Vol.62 No.4
The aim of this article is to study the h-almost Ricci solitons and h-almost gradient Ricci solitons on generalized Sasakian-space-forms. First, we consider h-almost Ricci soliton with the potential vector field V as a contact vector field on generalized Sasakian-space-form of dimension greater than three. Next, we study h-almost gradient Ricci solitons on a three-dimensional quasi-Sasakian generalized Sasakian-space-form. In both the cases, several interesting results are obtained.
S. VIJAY,K.N PRAKASHA,P.S HEMAVATHI,SMITHA G KINI 장전수학회 2022 Proceedings of the Jangjeon mathematical society Vol.25 No.2
In the midst of 20th century, Ivan Gutman invented the concept of energy of graph which is depends on the numbers 0 (if there is no edge between two vertices) and 1 (If two vertices are adjacent) in adjacency matrix. In the current paper we are introducing a degree based new matrix and energy. We define the matrix as follows (i, j)-entry is equal to ln(di+dj)+e(di+dj ) if i ≠ j and 0 otherwise.(where di, dj be the degree of its ith and jth vertices respectively) In this paper we compute the LE-Degree sum energy for graphs and some graph op- erations. Few important properties and bounds for DSLEE(G) are also discussed.
Symmetric key end to end Cryptosystem using Plateaued functions and Hadamard matrix
P. Poojary,K. Prakasha,P. K. Harikrishnan,G. R. Vadiraja Bhatta,Deepmala,A. Mitra 장전수학회 2020 Proceedings of the Jangjeon mathematical society Vol.23 No.1
Hadamard matrices are a special type of matrices having various applications in cryptography. Here we present a method for the construction of Hadamard matrices using plateaued Boolean functions. The key generated using Hadamard matrices is used for end to end encryption of the messages using symmetric key cryptography. The performance of the proposed system is compared with the Advanced Encryption Standard (AES), and RSA cryptosystems. The results prove that the proposed system outperforms existing systems.
Experimental exergy assessment of ground source heat pump system
Ahmad, Saif Nawaz,Prakasha, Om Techno-Press 2019 Advances in energy research Vol.6 No.2
The principal intention of this experimental work is to confer upon the exergy study of GSHP associated with horizontal earth heat exchanger for space heating. The exergy analysis recognizes the assessment of the tendency of various energy flows and quantifies the extensive impression of inefficiencies in the system and its components. Consequently, this study intends to provide the enlightenment for well interpretation of exergy concept for GSHP. This GSHP system is composed of heat pump cycle, earth heat exchanger cycle and fan coil cycle. All the required data were measured and recorded when the experimental set up run at steady state and average of the measured data were used for exergy investigation purpose. In this study the rate at which exergy destructed at all the subsystems and system has been estimated using the analytical expression. The overall rational exergetic efficiency of the GSHP system was evaluated for estimating its effectiveness. Hence, we draw the exergy flow diagram by using the various calculated results. The result shows that in the whole system the maximum exergy destruction rate component was compressor and minimum exergy flow component was earth heat exchanger. Consequently, compressor and earth heat exchanger need to be pay more attention.
K. Srinivasa Rao,K. N. PRAKASHA,KADIRVEL SARAVANAN,Ismail Naci CANGUL 장전수학회 2021 Advanced Studies in Contemporary Mathematics Vol.31 No.1
In this paper, maximum degree energy of graphs is studied. After giving some preliminary new results, bounds for the maximum degree eigenvalues are obtained for a general graph. Also bounds on the maximum degree eigenvalues of some frequently used graph classes are given by means of combinatorial, number theoretical and analysis methods. Many proofs are established by means of some result obtained by Adiga and Smitha. Maximum degree energy is calculated for any given simple graph and also for some classes of graphs and obtained relations with others. Special emphasis is given to unicyclic graphs. Several unicyclic graph classes are dened and their maximum degree eigenvalues and energy are calculated.