http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Ganesamoorthy (검색결과 7 건)
- 무료
- 기관 내 무료
- 유료
-
R. Ganesamoorthy,G. Suresh,K.R. Padmavathi,J. Rajaparthiban,R. Vezhavendhan,G. Bharathiraja 한국섬유공학회 2022 Fibers and polymers Vol.23 No.10
The influence of lignite flyash into the interpenetrating polymer network (IPN) matrix is thoroughly investigatedin this study. The standard weight ratio of E-Glass fiber have been chosen as the reinforcement into the IPN (vinylester/polyurethane) matrix, along with the varying loading of flyash as 0 %, 1 %, 3 %, 5 %, 7 %, 9 % (wt. ratio) respectively,fabricated through the hand lay-up technique. In order to completely understand the physical properties of the flyash loadedIPN composite (E-glass fiber reinforcement) specimen’s tests like differential thermal analysis (DTA), Tensile, Flexural,Compression, Impact, HDT (Heat Deflection Test), and wear test is performed. It was interesting to note that, upon loadingthe flyash into the matrix, the test result confirms that, there was a precipitous increase in the physical strength of all thespecimens’ up to the level of 5 % flyash loading except compressive and Barcoal hardness. Moreover to completely knowabout the bonding and de-bonding strength (flyash & matrix) of the fractured surfaces scanning electron microscope (SEM)analysis has been carried out. Out of all, the 5 % flyash loaded specimens have showed unique characteristics in physicalstrength, wear resistance and enhanced thermal stability as compared with the remaining set of flyash loaded samples.
-
Solvent-Free Synthesis of Some1-Acetyl Pyrazoles
Thirunarayanan, Ganesamoorthy,Sekar, Krishnamoorthy Guna Korean Chemical Society 2013 대한화학회지 Vol.57 No.5
Some N-acetyl pyrazoles including 1-(3-(3,4-dichlorophenyl)-5-(substituted phenyl)-4,5-dihydro-$^1H$-pyrazole- 1-yl) ethanones have been synthesised by solvent free cyclization cum acetylation of chalcones like substituted styryl 3,4- dichlorophenyl ketones using hydrazine hydrate and acetic anhydride in presence of catalytic amount of fly-ash: $H_2SO_4$ catalyst. The yield of these N-acetyl pyrazole derivatives are more than 75%. The synthesised N-acetyl pyrazoline derivatives were characterized by their physical constants and spectral data.
-
A. Athijayamani,R. Ganesamoorthy,K. T. Loganathan,S. Sidhardhan 한국고분자학회 2016 폴리머 Vol.40 No.1
This paper presents preparation of unidirectional aligned agave sisalana variegata fiber-reinforced vinyl ester composite laminates and their mechanical properties such as tensile, shear, flexural and impact strength. Wet hand layup technique was used for the preparation of composites. Mechanical tests were carried out for different weight percentage of fiber by varying the number of layers. Mechanical properties were analyzed as a function of wt%. The maximum tensile, flexural, impact and shear strength was observed on a composite designated as D. But the maximum tensile and flexural modulus values were identified in a composite designated as E. Experimental results were compared with theoretical results such as the rule of mixture and Bowyer and Bader model. Bowyer and Bader model was able to predict the strength and modulus of the composites better than the rule of the mixture model. The comparison between experimental and predicted values was also done by the student t test.
-
Upper edge-to-vertex detour monophonic number of a graph
A. P. Santhakumaran,P. Titus,K. Ganesamoorthy 장전수학회 2016 Advanced Studies in Contemporary Mathematics Vol.26 No.2
For a connected graph G = (V,E) of order at least three, the monophonic distance dm(u, v) is the length of a longest u−v monophonic path in G. A u − v path of length dm(u, v) is called a u − v detour monophonic. For subsets A and B of V , the monophonic distance dm(A,B) is defined as dm(A,B) = min{dm(x, y) : x ∈ A, y ∈ B}. A u−v path of length dm(A, B) is called an A−B detour monophonic path joining the sets A,B ⊆ V, where u ∈ A and v ∈ B. A set S ⊆ E is called an edge-to-vertex detour monophonic set of G if every vertex of G is incident with an edge of S or lies on a detour monophonic path joining a pair of edges of S. The edge-to-vertex detour monophonic number dmev(G) of G is the minimum cardinality of its edge-to-vertex detour monophonic sets and any edge-to-vertex detour monophonic set of car- dinality dmev(G) is an edge-to-vertex detour monophonic basis of G. An edge-to-vertex detour monophonic set S in a connected graph G is called a minimal edge-to-vertex detour monophonic set of G if no proper subset of S is an edge-to-vertex detour monophonic set of G. The upper edge-to-vertex detour monophonic number dm+ ev(G) of G is the maxi- mum cardinality of a minimal edge-to-vertex detour monophonic set of G. We determine bounds for it and certain general properties of these concepts are studied. It is shown that for every pair a, b of integers with 2 ≤ a ≤ b, there exists a connected graph G with dmev(G) = a and dm+ ev(G) = b.
-
ON THE MONOPHONIC NUMBER OF A GRAPH
A. P. Santhakumaran,P. Titus,K. Ganesamoorthy 한국전산응용수학회 2014 Journal of applied mathematics & informatics Vol.32 No.1
For a connected graph G = (V,E) of order at least two, a set S of vertices of G is a monophonic set of G if each vertex v of G lies on an χ−y monophonic path for some elements χ and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G, denoted by m(G). Certain general properties satisfied by the monophonic sets are studied. Graphs G of order p with m(G) = 2 or p or p −1 are characterized. For every pair a, b of positive integers with 2≤a≤b, there is a connected graph G with m(G) = a and g(G) = b, where g(G) is the geodetic number of G. Also we study how the monophonic number of a graph is affected when pendant edges are added to the graph.
-
ON THE MONOPHONIC NUMBER OF A GRAPH
Santhakumaran, A.P.,Titus, P.,Ganesamoorthy, K. The Korean Society for Computational and Applied M 2014 Journal of applied mathematics & informatics Vol.32 No.1
For a connected graph G = (V,E) of order at least two, a set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x - y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G, denoted by m(G). Certain general properties satisfied by the monophonic sets are studied. Graphs G of order p with m(G) = 2 or p or p - 1 are characterized. For every pair a, b of positive integers with $2{\leq}a{\leq}b$, there is a connected graph G with m(G) = a and g(G) = b, where g(G) is the geodetic number of G. Also we study how the monophonic number of a graph is affected when pendant edges are added to the graph.
-
Connected edge detour monophonic number of a graph
P. Titus,P. Balakrishnan,A. P. Santhakumaran,K. Ganesamoorthy 장전수학회 2013 Proceedings of the Jangjeon mathematical society Vol.16 No.4
Connected edge detour monophonic number of a graph
DBpia
ScienceON연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
