Zobrazeno 1 - 8
of 8
pro vyhledávání: '"K. N. Prakasha"'
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2024 (2024)
In literature, several types of join operations of two graphs based on subdivision graph, Q-graph, R-graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation
Externí odkaz:
https://doaj.org/article/d6c660bd17fe420797c107055c2ce7d5
Publikováno v:
The Nepali Mathematical Sciences Report. 39:95-105
Randić index is one of the most famous topological graph indices. The energy of a graph was defined more than four decades ago for its molecular applications. The classical energy of a graph modeling a molecule is defined as the sum of absolute valu
Publikováno v:
Far East Journal of Applied Mathematics. 113:11-27
Autor:
K. N. Prakasha
Publikováno v:
International Journal for Research in Applied Science and Engineering Technology. 9:86-92
Motivated by the inverse sum status index, we introduce the inverse sum status matrix ISS={■((σ_u σ_v)/((σ_u+σ_v ) ) if u_i~v_j,@0 otherwise)┤ Thus we also obtained the results for well known graphs. Keywords: Inverse sum status energy, Inver
Publikováno v:
Journal of Informatics and Mathematical Sciences. 10:13-22
The partition energy of a graph was introduced by Sampathkumar et al. [12]. Motivated by this, we introduce the concept of minimum equitable dominating partition energy of a graph, \(E^E_p (G)\) and compute the minimum equitable dominating partition
Publikováno v:
Turkish Journal of Analysis and Number Theory. 5:202-209
The purpose of this paper is to introduce and investigate the symmetric division deg energy SDDE(G) of a graph. We establish upper and lower bounds for SDDE(G). Also the symmetric division deg energy for certain graphs with one edge deleted are calcu
Publikováno v:
Advances and Applications in Discrete Mathematics. 18:191-211
In this paper, we introduce the minimum equitable dominating Randic energy of a graph and computed the minimum dominating Randic energy of graph. Also, established the upper and lower bounds for the minimum equitable dominating Randic energy of a gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18ee23017c48a11958fedd5e7ca41df6