Zobrazeno 1 - 10
of 97
pro vyhledávání: '"N, Mohanapriya"'
In this research, the exact results on $r$-dynamic coloring of lexicographic product of path with star graph, path with double star graph, path with triple star graph and finally complete graph with path are obtained.
Externí odkaz:
http://arxiv.org/abs/2105.08225
Publikováno v:
Neutrosophic Sets and Systems, Vol 48, Pp 306-317 (2022)
In 1998, Smarandache introduced the new theory - Neutrosophic sets. In order to achieve the best results in a current situation, policy makers must contend with uncertainty and unpredictability. The neutrosophic definition aids in the investigation o
Externí odkaz:
https://doaj.org/article/a77a586c41024f839f53f11ea6ba2e98
Publikováno v:
International Journal of Open Problems in Computer Science & Mathematics; Mar2024, Vol. 17 Issue 1, p1-14, 14p
Publikováno v:
CAUCHY: Jurnal Matematika Murni dan Aplikasi. 7:622-630
A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}. A distance irregular reflexive k-labeling of the graph G is the total
Publikováno v:
In Industrial Crops & Products 15 November 2018 124:954-959
Autor:
Naveen Chandrasekaran, N Mohanapriya
Publikováno v:
Langmuir. 38:12581-12593
We report the synthesis of iminium-bridged resorcinol-silane (I-R-S) gel networks through the reaction of resorcinol with 3-aminopropyl triethoxysilane (APTES) in the presence of acetone under ambient conditions. Ambient pressure drying leads to mono
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:1457-1473
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
Let [Formula: see text] be a simple connected graph consisting of n vertices and [Formula: see text] edges. In a proper [Formula: see text]-coloring, an [Formula: see text]-dynamic coloring of a graph [Formula: see text] is one in which each vertex
Publikováno v:
Asian-European Journal of Mathematics.
Let [Formula: see text] be a simple, un-directed and connected graph. The graph [Formula: see text] has a pair of sets [Formula: see text], where [Formula: see text] is nonempty vertex set and [Formula: see text] is an unordered pair of sets with two
Publikováno v:
5th INTERNATIONAL CONFERENCE ON CURRENT SCENARIO IN PURE AND APPLIED MATHEMATICS (ICCSPAM-2022).