Welcome to International Journal of Emerging Technologies in Engineering Research (IJETER)
Volume 2, Issue 3, October (2015)
| S.No | Tile & Authors | Full Text |
|---|---|---|
| 1 | Special Class of Homo-Cordial Graphs Dr. A. Nellai Murugan, A. Mathubala Abstract – Let G = (V,E) be a graph with p vertices and q edges. A Homo-Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label 1if f (u) =f (v) or 0 if f (u) ≠ f (v) with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits a Homo-Cordial Labeling (HoCL) is called Homo-Cordial Graph (HoCG). In this paper, we proved that the graphs Z-(Pn), Twig Tgn, (P2 ⋃ mK1)+N2, Jelly Fish J(m,n) are Homo-Cordial Graphs. |
Download |
| 2 | Linear Static Analysis and Design Optimization of Boiler Platform Using CAE Anjappa S.B, Dr. G Venkateshwaralu Abstract – Boiler Platform is one of the major components of the boiler assembly. This will be mounted on the structure support of boiler through mounting arms, for the purpose of maintenance, readings and calibration of boiler. As the Boiler platform experience the vibrations, Static Loads and temperature it becomes imperative that analysis is carried out thoroughly, mainly the Linear static stress analysis due the application of static load before fabrication and installation. Static stress analysis or linear static analysis had been part of design strategy for many years on platforms and other supporting structures in all forms of applications. This determines load carrying capacity of the platform by means of displacements, strains, stresses, and reaction forces under the effect of applied loads and boundary conditions. Here the Computer Aided engineering (CAE) and Finite element analysis (FEA) will be used. In present work linear static load carrying behavior of the boiler platform is evaluated and its load carrying capacity will be improved by approximately 20% with design optimization keeping the material as constant using FEA. |
Download |
| 3 | Path Related Hetro-Cordial Graphs Dr. A. Nellai Murugan, V. Selva Vidhya Abstract – Let G = (V,E) be a graph with p vertices and q edges. A Hetro-Cordial labeling of a graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label 0 if f(u) = f(v) or 1 if f(u) ≠ f(v) with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by atmost 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. The graph that admits a Hetro-Cordial labeling is called a Hetro Cordial Graph (HeCG). In this paper, we proved that path related graphs Path Pn, Comp PnʘK1 , Fan Pn+K1, Double fan Pn+2K1, Ladder Pn X K2 are Hetro-Cordial Graphs. |
Download |
| 4 | Image De-Noising using Decision Based Enhanced Window Median Filter with Multiple Scannings Jaspreet Kaur, Jaskiran Kaur Abstract – Image restoration is defined as a process to restore the degraded image to gain its original information. Number of algorithms and filters were proposed to denoise the image but results were not efficient. The idea of making an algorithm to vanish the impurities of the image has taken advance steps. Proposed algorithm also deals with clarity of noisy image after restoration at different noise densities. |
Download |
| 5 | Path Related Mean Square Cordial Graphs Dr. A. Nellai Murugan, S.Heerajohn Abstract – Let G = (V,E) be a graph with p vertices and q edges. A Mean Square Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label ( ⌈(𝒇(𝒖))𝟐+(𝒇(𝒖))𝟐⌉ )𝟐⁄ where ⌈ x ⌉ (ceilex) is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits a Mean Square Cordial Labeling is called Mean Square Cordial Graph. In this paper, we proved that Path related graphs Sp(Pn,K1,n), (P2∪mk1)+N2 (m-odd), PnʘC3, Pn@2k1,m, PnSm (n-even) are Mean Square Cordial Graphs. |
Download |
Publication Process
Accepted papers will be published online immediately,upon receiving the final version from the authors.
Paper Submission
There is no deadline for paper submission. Authors are requested to send their unpublished manuscripts to: ijetereditor@gmail.com
Copyright
COPYRIGHT © EverScience Publications