Zobrazeno 1 - 10
of 172
pro vyhledávání: '"R Sampathkumar"'
Autor:
N Paramaguru, R Sampathkumar
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 2, Iss 2, Pp 139-149 (2014)
For k≥2, a modular k-coloring of a graph G without isolated vertices is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G, the sums of the colors of their neighbors are different i
Externí odkaz:
https://doaj.org/article/9b3c31b8ae0940ff877dfd764a03853b
Autor:
R. Rajarajachozhan, R. Sampathkumar
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 158-162 (2019)
The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph G of size m is a, the maximum number of odd cycles in such a cycle decompositio
Externí odkaz:
https://doaj.org/article/9da6f992767343be82e2b2955bab39f6
Autor:
N. Paramaguru, R. Sampathkumar
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 146-156 (2016)
For a connected graph G of order |V(G)|≥3 and a k-edge-weighting c:E(G)→{1,2,…,k} of the edges of G, the code, codec(v), of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are
Externí odkaz:
https://doaj.org/article/988a8e3629a84bfbb2edf519092dca97
Autor:
Moti Lal Rinawa, Rajneesh Sharma, Prasad Ramchandra Baviskar, R. Sampathkumar, Radhika G Deshmukh, M. Venkata Rao, Ram Subbiah
Publikováno v:
Materials Today: Proceedings. 62:5218-5222
Publikováno v:
Journal of Surface Science and Technology.
Dielectric relaxation studies of acetate buffer solutions of Sodium Dodecyl Sulphate (SDS- anionic), Cetyl Trimethyl Ammonium Bromide (CTAB- cationic), Tween 80 (TW-80-non-ionic), Betaine Anhydrous (BA- zwitterionic) surfactants have been examined in
Autor:
N. Paramaguru, R. Sampathkumar
Publikováno v:
Transactions on Combinatorics, Vol 4, Iss 3, Pp 53-61 (2015)
Let G be a connected graph of order 3 or more and c:E(G)→Z k (k≥2 ) a k -edge coloring of G where adjacent edges may be colored the same. The color sum s(v) of a vertex v of G is the sum in Z k of the colors of the edges incident wit
Externí odkaz:
https://doaj.org/article/8700f1434532413aaab10722577d8279
Publikováno v:
Transactions on Combinatorics, Vol 4, Iss 1, Pp 19-29 (2015)
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is min {d(D) |D belongs to D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some subgraph
Externí odkaz:
https://doaj.org/article/7e20057900cc48b6ade99c6c925fcd4f
Publikováno v:
Proceedings on Engineering Sciences, Vol 3, Iss 2, Pp 231-238 (2021)
In this paper, the complementary of arithmetic mean, geometric mean, harmonic mean and contra harmonic mean with respect to Heron mean are defined. Further, by finding the partial derivatives developed the Schur convexity and Schur geometric convexit
Autor:
N. Paramaguru, R. Sampathkumar
Publikováno v:
Transactions on Combinatorics, Vol 2, Iss 2, Pp 47-72 (2013)
A modular $k$-coloring, $kge 2,$ of a graph $G$ without isolated vertices is a coloring of the vertices of $G$ with the elements in $mathbb{Z}_k$ having the property that for every two adjacent vertices of $G,$ the sums of the colors of the neighbors
Externí odkaz:
https://doaj.org/article/d41f383ec75f48c39737bb601873eda0
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:8175-8185