Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Hari Naresh Kumar"'
Autor:
Raghavendra H Kashyap, Yanamandram B Venkatakrishnan, Rashad Ismail, Selvaraj Balachandran, Hari Naresh Kumar
Publikováno v:
Ural Mathematical Journal, Vol 10, Iss 1 (2024)
Let \(G=(V,E)\) be a simple connected graph. The modified Sombor index denoted by \(mSo(G)\) is defined as $$mSo(G)=\sum_{uv\in E}\frac{1}{\sqrt{d^2_u+d^2_v}},$$ where \(d_v\) denotes the degree of vertex \(v\). In this paper we present extremal valu
Externí odkaz:
https://doaj.org/article/fe39b4cf96f84e66a8ad0141e3bb1133
Publikováno v:
Vietnam Journal of Mathematics. 49:1135-1140
Let G be a simple graph with vertex set V (G) and edge set E(G). A vertex v ∈ V (G) vertex-edge dominates every edge uv incident to v, as well as every edge adjacent to these incident edges. A set $D\subseteq V(G)$ is a vertex-edge dominating set i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32186e3c948b365e5446caf571f0199d
https://doi.org/10.1007/s10013-020-00436-w
https://doi.org/10.1007/s10013-020-00436-w
Autor:
Kaliraj, Kalimuthu, Hari, Naresh Kumar
For any graph class G of any two positive integers i and j, the Ramsey number RG(i, j) is the smallest integer such that every graph in G on atleast RG(i, j) vertices has a clique of size i or an independent set of size j. In this paper, we found the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3401::5891534f3b8f43c772b1d2aa60ff5d18
https://hdl.handle.net/11729/2710
https://hdl.handle.net/11729/2710
