N. Mohanapriya
YOU?
Author Swipe
View article: On dominator and total dominator coloring of duplication corresponding corona of path, pan, complete and sunlet graphs
On dominator and total dominator coloring of duplication corresponding corona of path, pan, complete and sunlet graphs Open
A dominator coloring of a graph \(\mathscr{G}\) is a proper coloring where each vertex of \(\mathscr{G}\) is within the closed neighborhood of at least one vertex from each color class. The minimum number of color classes required for a do…
View article: On Local Antimagic b-Coloring and Its Application for STGNN Time Series Forecasting on Horizontal Farming
On Local Antimagic b-Coloring and Its Application for STGNN Time Series Forecasting on Horizontal Farming Open
This article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to . The bijection is said to be a loc…
View article: Analyzing \(b\)-color local edge antimagic coloring in graphs
Analyzing \(b\)-color local edge antimagic coloring in graphs Open
A bijective mapping \(\varsigma\) assigns each vertex of a graph \(G\) a unique positive integer from 1 to \(|V(G)|\), with edge weights defined as the sum of the values at its endpoints. The mapping ensures that no two adjacent edges at a…
View article: Optimal secret share distribution in degree splitting communication networks
Optimal secret share distribution in degree splitting communication networks Open
Dynamic coloring has recently emerged as a valuable tool to optimize cryptographic protocols based on secret sharing, which enforce data security in communication networks and have significant importance in both online storage and cloud co…
View article: Optimal Shadow Allocations of Secret Sharing Schemes Arisen from the Dynamic Coloring of Extended Neighborhood Coronas
Optimal Shadow Allocations of Secret Sharing Schemes Arisen from the Dynamic Coloring of Extended Neighborhood Coronas Open
Every t-dynamic proper n-coloring of a graph G describes a shadow allocation of any (n,t+1)-threshold secret sharing scheme based on G, so that, after just one round of communication, each participant can either reconstruct the secret, or …
View article: On r-dynamic coloring of central vertex join of path, cycle with certain graphs
On r-dynamic coloring of central vertex join of path, cycle with certain graphs Open
Let G = ( V, E ) be a simple finite connected and undirected graph with n vertices and m edges. The n vertices are assigned the colors through mapping c : V [ G ] → I + . An r -dynamic coloring is a proper k -coloring of a graph G such tha…
View article: On r-dynamic coloring of comb graphs
On r-dynamic coloring of comb graphs Open
An r-dynamic coloring of a graph G is a proper coloring of G such that every vertex in V(G) has neighbors in at least $\min\{d(v),r\}$ different color classes. The r-dynamic chromatic number of graph G denoted as $\chi_r (G)$, is the least…
View article: On $r$-dynamic coloring on lexicographic product of star graphs
On $r$-dynamic coloring on lexicographic product of star graphs Open
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.
View article: b-chromatic number of extended corona of some graphs
b-chromatic number of extended corona of some graphs Open
In this paper we find out the b-chromatic number for the extended corona of path with complete on the same order Pn.kn path on order n with star graph on order n+1 say ,Pn.kn+1 cycle with complete on the same order ,Cn.kn cycle on order n …
View article: On r-Dynamic Coloring of Neighborhood Corona of Path with Some graphs
On r-Dynamic Coloring of Neighborhood Corona of Path with Some graphs Open
Consider the simple, finite, connected and undirected graph H = ( V, E ) in which V and E denotes the vertex set and edge set of the graph H . The r -dynamic coloring of a graph H is the proper p-coloring of the vertices of the graph H in …
View article: r-Dynamic Coloring on Snark Families
r-Dynamic Coloring on Snark Families Open
An r-dynamic coloring of a graph is a proper minimum coloring of the vertices such that , for each and it is …
View article: On r - dynamic coloring of some graphs
On r - dynamic coloring of some graphs Open
View article: On r - dynamic vertex coloring of some graphs
On r - dynamic vertex coloring of some graphs Open
View article: On dynamic coloring of certain cycle-related graphs
On dynamic coloring of certain cycle-related graphs Open
Coloring the vertices of a particular graph has often been motivated by its utility to various applied fields and its mathematical interest. A dynamic coloring of a graph G is a proper coloring of the vertex set V(G) such that for each ver…
View article: δ-Dynamic chromatic number of Helm graph families
δ-Dynamic chromatic number of Helm graph families Open
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that $ \\left|c(N(v))\\right| \\ge min \\left\\{ r, d(v)\\right\\} $, for each $ v\\in V(G) $, where N(v) and d(v) denote the neighborhood and the degree of v, …