Zobrazeno 1 - 10
of 609
pro vyhledávání: '"G Sethuraman"'
Autor:
G. Sethuraman, M. Nithya
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-16 (2024)
A radio labeling of a graph G is a function [Formula: see text] such that for every pair of distinct vertices [Formula: see text], where diam(G) denotes the diameter of the graph and d(u, v) is the distance between the vertices u and v. The span of a
Externí odkaz:
https://doaj.org/article/1d0c182a00214e5e953f2980eacd5c30
Publikováno v:
Indian Dermatology Online Journal, Vol 9, Iss 4, Pp 284-285 (2018)
Externí odkaz:
https://doaj.org/article/fd7d9e41031240b8a36f90633810e12d
Autor:
G. Sethuraman, K. M. Shermily
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 2, Pp 110-116 (2021)
An antimagic labeling of a graph G with q edges is an injective mapping such that the induced vertex label for each vertex is different, where the induced vertex label of a vertex u is Here, E(u) is the set of edges incident to the vertex u. In 1990,
Externí odkaz:
https://doaj.org/article/5f5059c1171f425bac14c22caa42a6d2
Autor:
G. Sethuraman, M. Sujasree
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 174-183 (2020)
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of
Externí odkaz:
https://doaj.org/article/b1d74fcd28e447a2897e58ee3c06ca26
Autor:
P. Ragukumar, G. Sethuraman
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 632-636 (2020)
The binomial tree consists of a single vertex. The binomial tree is an ordered tree defined recursively. The binomial tree consists of two binomial trees that are linked together: the root of one is the leftmost child of the root of the other. The po
Externí odkaz:
https://doaj.org/article/6f990a94e07144da9c2a4d13101b6f6e
Autor:
G. Sethuraman, V. Murugan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 592-605 (2020)
Acharya (1982) proved that every connected graph can be embedded in a graceful graph. The generalization of this result that, any set of graphs can be packed into a graceful graph was proved by Sethuraman and Elumalai (2005). Recently, Sethuraman et
Externí odkaz:
https://doaj.org/article/d81c223a0c14454ca9d446be2d57f954
Autor:
G. Sethuraman, M. Sujasree
Publikováno v:
Theory and Applications of Graphs, Vol 7, Iss 2 (2020)
In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decompose
Externí odkaz:
https://doaj.org/article/c9b9fc5a292c456ba090fd7a20c3de28
Autor:
G. Sethuraman, P. Ragukumar
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 2, Pp 118-129 (2017)
Inspired by the method of Koh et al. (1979) of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of known graceful trees, in a specific way. In fact, each member of this new cla
Externí odkaz:
https://doaj.org/article/0d8bcb047c354fd481b74a228e6d31c7
Publikováno v:
Journal of Sol-Gel Science and Technology. 103:12-38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ec77ade6498e9d2867808b3963adeeb
https://doi.org/10.1007/s10971-022-05818-9
https://doi.org/10.1007/s10971-022-05818-9
Publikováno v:
Research Journal of Textile and Apparel.
Purpose This study aims to develop multifunctional, namely, superhydrophobic, flame-retardant and antibacterial, coatings over cotton fabric, using casein as green-based flame-retardant and silver nanoparticles as antibacterial agent by solution imme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bed7f35d346a48bf8d829f49cd55ba58
https://doi.org/10.1108/rjta-05-2022-0055
https://doi.org/10.1108/rjta-05-2022-0055