This document discusses cubic graceful labeling of graphs. It proves that certain combinations of star graphs and path graphs admit cubic graceful labelings. Specifically, it proves that the graph formed by joining the centers of four stars K1,a, K1,b, K1,c, K1,d to a single vertex u is cubic graceful for all a, b, c, d ≥ 1. It also proves that the graph formed by associating the vertices vr and ur of two copies of the path Pn is cubic graceful. Finally, it proves that the graph formed by joining corresponding vertices of two copies of the path Pn is cubic graceful. Cubic graceful labeling assigns unique integers to vertices such that edge differences are also
In this paper we proved some new theorems related with Cubic Harmonious Labeling. A (n,m) graph G =(V,E) is said to be Cubic Harmonious Graph(CHG) if there exists an injective function f:V(G)?{1,2,3,………m3+1} such that the induced mapping f *chg: E(G)? {13,23,33,……….m3} defined by f *chg (uv) = (f(u)+f(v)) mod (m3+1) is a bijection. In this paper, focus will be given on the result “cubic harmonious labeling of star, the subdivision of the edges of the star K1,n , the subdivision of the central edge of the bistar Bm,n, Pm ? nK1”.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
En el presente trabajo encontraremos conceptos básicos sobre números reales al igual que ejemplos. También conceptos sobre inecuaciones y desigualdades y sus ejercicios, operaciones con conjuntos
In this paper we proved some new theorems related with Cubic Harmonious Labeling. A (n,m) graph G =(V,E) is said to be Cubic Harmonious Graph(CHG) if there exists an injective function f:V(G)?{1,2,3,………m3+1} such that the induced mapping f *chg: E(G)? {13,23,33,……….m3} defined by f *chg (uv) = (f(u)+f(v)) mod (m3+1) is a bijection. In this paper, focus will be given on the result “cubic harmonious labeling of star, the subdivision of the edges of the star K1,n , the subdivision of the central edge of the bistar Bm,n, Pm ? nK1”.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
En el presente trabajo encontraremos conceptos básicos sobre números reales al igual que ejemplos. También conceptos sobre inecuaciones y desigualdades y sus ejercicios, operaciones con conjuntos
jstse 2015 question paper with solution,
jstse books,
jstse book for class 9 pdf,
jstse 2016-17,
how to prepare for jstse,
jstse 2015 answer key,
jstse exam sample paper for class 9,
jstse official website,
jstse previous year papers,
jstse,
It is a algorithm used to find a minimum cost spanning tree for connected weighted undirected graph.This algorithm first appeared in Proceedings of the American Mathematical Society in 1956, and was written by Joseph Kruskal.
Hosoya polynomial, wiener and hyper wiener indices of some regular graphsieijjournal
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a shortest
path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G,
whereas the hyper-Wiener index WW(G) is defined as ( ) ( ( ) ( ) ) ( )
2
{u,v} V G
WW G d v,u d v,u .
Î
= + Also, the
Hosoya polynomial was introduced by H. Hosoya and define ( ) ( )
( )
,
{u,v} V G
, . d v u H G x x
Î
= In this
paper, the Hosoya polynomial, Wiener index and Hyper-Wiener index of some regular graphs are
determined.
Lattice points on the homogeneous cone 5(x2+y2) 9xy=23z2eSAT Journals
Seven different method s of the non-zero non-negative solutions of homogeneous Diophantine equation 5(x2 + y2) – 9xy = 23z2 are obtained. Introducing the linear transformation x =u + v, y= u – v, u v0 in 5(x2+y2) -9xy = 23z2, it reduces to u2 + 19v2 =23z2. We are solved the above equation through various choices and are obtained seven different methods of solutions which are satisfied it. Some interesting relations among the special numbers and the solutions are exposed.
Embedding and np-Complete Problems for 3-Equitable GraphsWaqas Tariq
We present here some important results in connection with 3-equitable graphs. We prove that any graph G can be embedded as an induced subgraph of a 3-equitable graph. We have also discussed some properties which are invariant under embedding. This work rules out any possibility of obtaining a forbidden subgraph characterization for 3-equitable graphs.
DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHSgraphhoc
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with
max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple
graph are discussed.
A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with
distinct positive integers not exceeding n such that the labels of each pair of adjacent vertices are relatively
prime. A graph G which admits prime labeling is called a prime graph. In this paper we investigate the
existence of prime labeling of some graphs related to cycle Cn, wheel 푊푛
,crown 퐶푛
∗
,Helm퐻푛and Gear
graph퐺푛
,Star푠푛
, Friendship graph 푇푛
,prism 퐷푛 and Butterfly graph 퐵푛,푚 .We discuss prime labeling in the
context of the graph operation namely duplication.
jstse 2015 question paper with solution,
jstse books,
jstse book for class 9 pdf,
jstse 2016-17,
how to prepare for jstse,
jstse 2015 answer key,
jstse exam sample paper for class 9,
jstse official website,
jstse previous year papers,
jstse,
It is a algorithm used to find a minimum cost spanning tree for connected weighted undirected graph.This algorithm first appeared in Proceedings of the American Mathematical Society in 1956, and was written by Joseph Kruskal.
Hosoya polynomial, wiener and hyper wiener indices of some regular graphsieijjournal
Let G be a graph. The distance d(u,v) between two vertices u and v of G is equal to the length of a shortest
path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G,
whereas the hyper-Wiener index WW(G) is defined as ( ) ( ( ) ( ) ) ( )
2
{u,v} V G
WW G d v,u d v,u .
Î
= + Also, the
Hosoya polynomial was introduced by H. Hosoya and define ( ) ( )
( )
,
{u,v} V G
, . d v u H G x x
Î
= In this
paper, the Hosoya polynomial, Wiener index and Hyper-Wiener index of some regular graphs are
determined.
Lattice points on the homogeneous cone 5(x2+y2) 9xy=23z2eSAT Journals
Seven different method s of the non-zero non-negative solutions of homogeneous Diophantine equation 5(x2 + y2) – 9xy = 23z2 are obtained. Introducing the linear transformation x =u + v, y= u – v, u v0 in 5(x2+y2) -9xy = 23z2, it reduces to u2 + 19v2 =23z2. We are solved the above equation through various choices and are obtained seven different methods of solutions which are satisfied it. Some interesting relations among the special numbers and the solutions are exposed.
Embedding and np-Complete Problems for 3-Equitable GraphsWaqas Tariq
We present here some important results in connection with 3-equitable graphs. We prove that any graph G can be embedded as an induced subgraph of a 3-equitable graph. We have also discussed some properties which are invariant under embedding. This work rules out any possibility of obtaining a forbidden subgraph characterization for 3-equitable graphs.
DISTANCE TWO LABELING FOR MULTI-STOREY GRAPHSgraphhoc
An L (2, 1)-labeling of a graph G (also called distance two labeling) is a function f from the vertex set V (G) to the non negative integers {0,1,…, k }such that |f(x)-f(y)| ≥2 if d(x, y) =1 and | f(x)- f(y)| ≥1 if d(x, y) =2. The L (2, 1)-labeling number λ (G) or span of G is the smallest k such that there is a f with
max {f (v) : vє V(G)}= k. In this paper we introduce a new type of graph called multi-storey graph. The distance two labeling of multi-storey of path, cycle, Star graph, Grid, Planar graph with maximal edges and its span value is determined. Further maximum upper bound span value for Multi-storey of simple
graph are discussed.
A Graph G with n vertices is said to admit prime labeling if its vertices can be labeled with
distinct positive integers not exceeding n such that the labels of each pair of adjacent vertices are relatively
prime. A graph G which admits prime labeling is called a prime graph. In this paper we investigate the
existence of prime labeling of some graphs related to cycle Cn, wheel 푊푛
,crown 퐶푛
∗
,Helm퐻푛and Gear
graph퐺푛
,Star푠푛
, Friendship graph 푇푛
,prism 퐷푛 and Butterfly graph 퐵푛,푚 .We discuss prime labeling in the
context of the graph operation namely duplication.
Randić Index of Some Class of Trees with an AlgorithmEditor IJCATR
The Randić index R(G) of a graph G is defined as the sum of the weights (dG(u)dG(v))-1/2 over all edges e = uv of G. In this
paper we have obtained the Randić index of some class of trees and of their complements. Also further developed an algorithmic
technique to find Randić index of a graph.
Some Common Fixed Point Results for Expansive Mappings in a Cone Metric SpaceIOSR Journals
The purpose of this work is to extend and generalize some common fixed point theorems for Expansive type mappings in complete cone metric spaces. We are attempting to generalize the several well- known recent results. Mathematical subject classification; 54H25, 47H10
Given a graph G=(V,E), two subsets S_1 and S_2 of the vertex set V are homometric, if their distance multi sets are equal. The homometric number h(G) of a graph G is the largest integer k such that there exist two disjoint homometric subsets of cardinality k. We find lower bounds for the homometric number of the Mycielskian of a graph and the join and the lexicographic product of two graphs. We also obtain the homometric number of the double graph of a graph, the cartesian product of any graph with K_2 and the complete bipartite graph. We also introduce a new concept called weak homometric number and find weak homometric number of some graphs.
Data Mining is a significant field in today’s data-driven world. Understanding and implementing its concepts can lead to discovery of useful insights. This paper discusses the main concepts of data mining, focusing on two main concepts namely Association Rule Mining and Time Series Analysis
A Review on Real Time Integrated CCTV System Using Face Detection for Vehicle...rahulmonikasharma
We are describes the technique for real time human face detection and counting the number of passengers in vehicle and also gender of the passengers.The Image processing technology is very popular,now at present all are going to use it for various purpose. It can be applied to various applications for detecting and processing the digital images. Face detection is a part of image processing. It is used for finding the face of human in a given area. Face detection is used in many applications such as face recognition, people tracking, or photography. In this paper,The webcam is installed in public vehicle and connected with Raspberry Pi model. We use face detection technique for detecting and counting the number of passengers in public vehicle via webcam with the help of image processing and Raspberry Pi.
Considering Two Sides of One Review Using Stanford NLP Frameworkrahulmonikasharma
Sentiment analysis is a type of natural language processing for tracking the mood of the public about a particular product or a topic and is useful in several ways. Polarity shift is the most classical task which aims at classifying the reviews either positive or negative. But in many cases, in addition to the positive and negative reviews, there still many neutral reviews exist. However, the performance sometimes limited due to the fundamental deficiencies in handling the polarity shift problem. We propose an Improvised Dual Sentiment Analysis (IDSA) model to address this problem for sentiment classification. We first propose a novel data expansion technique by creating sentiment-reversed review for each training and test review. We develop a corpus based method to construct a pseudo-antonym dictionary. It removes DSA’s dependency on an external antonym dictionary for review reversion. We conduct a range of experiments and the results demonstrates the effectiveness of DSA in addressing the polarity shift in sentiment classification. .
A New Detection and Decoding Technique for (2×N_r ) MIMO Communication Systemsrahulmonikasharma
The requirements of fifth generation new radio (5G- NR) access networks are very high capacity and ultra-reliability. In this paper, we proposed a V-BLAST2 × N_r MIMO system that is analyzed, improved, and expected to achieve both very high throughput and ultra- reliability simultaneously.A new detection technique called parallel detection algorithm is proposed. The performance of the proposed algorithm compared with existing linear detection algorithms. It was seen that the proposed technique increases the speed of signal transmission and prevents error propagation which may be present in serial decoding techniques. The new algorithm reduces the bit error probability and increases the capacity simultaneouslywithout using a standard STC technique. However, it was seen that the BER of systems using the proposed algorithm is slightly higher than a similar system using only STC technique. Simulation results show the advantages of using the proposed technique.
Broadcasting Scenario under Different Protocols in MANET: A Surveyrahulmonikasharma
A wireless network enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world. Wireless networks allow people to interact with e-mail or browse the Internet from a location that they prefer. Adhoc Networks are self-organizing wireless networks, absent any fixed infrastructure. broadcasting of data through proper channel is essential. Various protocols are designed to avoid the loss of data. In this paper an overview of different broadcast protocols are discussed.
Sybil Attack Analysis and Detection Techniques in MANETrahulmonikasharma
Security is important for many sensor network applications. A particularly harmful attack against sensor and ad hoc networks is known as the Sybil attack [6], where a node Illegitimately claims multiple identities.Mobility cause a main problem when we talk about security in Mobile Ad-hoc networks. It doesn’t depend on fixed architecture, the nodes are continuously moving in a random fashion. In this article we will focus on identifying the Sybil attack in MANET. It uses air medium for communication so it is more prone to the attack. Sybil attack is one in which single node present multiple fake identities to other nodes, which cause destruction.
A Landmark Based Shortest Path Detection by Using A* and Haversine Formularahulmonikasharma
In 1900, less than 20 percent of the world populace lived in cities, in 2007, fair more than 50 percent of the world populace lived in cities. In 2050, it has been anticipated that more than 70 percent of the worldwide population (about 6.4 billion individuals) will be city tenants. There's more weight being set on cities through this increment in population [1]. With approach of keen cities, data and communication technology is progressively transforming the way city regions and city inhabitants organize and work in reaction to urban development. In this paper, we create a nonspecific plot for navigating a route throughout city A asked route is given by utilizing combination of A* Algorithm and Haversine equation. Haversine Equation gives least distance between any two focuses on spherical body by utilizing latitude and longitude. This least distance is at that point given to A* calculation to calculate minimum distance. The method for identifying the shortest path is specify in this paper.
Processing Over Encrypted Query Data In Internet of Things (IoTs) : CryptDBs,...rahulmonikasharma
Internet of Things (IoT) is the developing technologies that would be the biggest agents to modify the current world. Machine-to-machine communications perform with virtual, mobile and instantaneous connections. In IoT system, it consists of data-gathering sensors various other household devices. Intended for protecting IoT system, the end-to-end secure communication is a necessary measure to protect against unauthorized entities (e.g., modification attacks and eavesdropping,) and the data unprotected on the Cloud. The most important concern hereby is how to preserve the insightful information and to provide the privacy of user data. In IoT, the encrypted data computing is based on techniques appear to be promising approaches. In this paper, we discuss about the recent secure database systems, which are capable to execute SQL queries over encrypted data.
Quality Determination and Grading of Tomatoes using Raspberry Pirahulmonikasharma
In India cultivation of tomatoes is carried out by traditional methods and techniques. Today tremendous improvement in field of agriculture technologies and products can be seen. The tomatoes affect the overall production drastically. Image processing technique can be key technique for finding good qualities of tomatoes and grading. This work aimed to study different types of algorithms used for quality grading and sorting of fruit from the acquire image. In previous years several types of techniques are applied to analyses the good quality fruits. A simple system can be implemented using Raspberry pi with computer vision technology and image processing algorithms.
Comparative of Delay Tolerant Network Routings and Scheduling using Max-Weigh...rahulmonikasharma
Network management and Routing is supportively done by performing with the nodes, due to infrastructure-less nature of the network in Ad hoc networks or MANET. The nodes are maintained itself from the functioning of the network, for that reason the MANET security challenges several defects. Routing process and Scheduling is a significant idea to enhance the security in MANET. Other than, scheduling has been recognized to be a key issue for implementing throughput/capacity optimization in Ad hoc networks. Designed underneath conventional (LT) light tailed assumptions, traffic fundamentally faces Heavy-tailed (HT) assumption of the validity of scheduling algorithms. Scheduling policies are utilized for communication networks such as Max-Weight, backpressure and ACO, which are provably throughput optimality and the Pareto frontier of the feasible throughput region under maximal throughput vector. In wireless ad-hoc network, the issue of routing and optimal scheduling performs with time varying channel reliability and multiple traffic streams. Depending upon the security issues within MANETs in this paper presents a comparative analysis of existing scheduling policies based on their performance to progress the delay performance in most scenarios. The security issues of MANETs considered from this paper presents a relative analysis of existing scheduling policies depend on their performance to progress the delay performance in most developments.
DC Conductivity Study of Cadmium Sulfide Nanoparticlesrahulmonikasharma
The dc conductivity of consolidated nanoparticle of CdS has been studied over the temperature range from 303 K to 523 K and the conductivity has been found to be much larger than that of single crystals.
A Survey on Peak to Average Power Ratio Reduction Methods for LTE-OFDMrahulmonikasharma
OFDM (Orthogonal Frequency Division Multiplexing) is generally preferred for high data rate transmission in digital communication. The Long-Term Evolution (LTE) standards for the fourth generation (4G) wireless communication systems. Orthogonal Frequency Division Multiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) are the two multiple access techniques which are generally used in LTE.OFDM system has a major shortcoming of high peak to average power ratio (PAPR) value. This paper explains different PAPR reduction techniques and presents a comparison of the various techniques based on theoretical results. It also presents a survey of the various PAPR reduction techniques and the state of the art in this area.
IOT Based Home Appliance Control System, Location Tracking and Energy Monitoringrahulmonikasharma
Home automation has been a dream of sciences for so many years. It could wind up conceivable in twentieth century simply after power all family units and web administrations were begun being utilized on across the board level. The point of home robotization is to give enhanced accommodation, comfort, vitality effectiveness and security. Vitality checking and protection holds prime significance in this day and age in view of the irregularity between control age and request observing frameworks accessible in the market. Ordinarily, customers are disappointed with the power charge as it doesn't demonstrate the power devoured at the gadget level. This paper shows the outline and execution of a vitality meter utilizing Arduino microcontroller which can be utilized to gauge the power devoured by any individual electrical apparatus. The primary expectation of the proposed vitality meter is to screen the power utilization at the gadget level, transfer it to the server and build up remote control of any apparatus. So we can screen the power utilization remotely and close down gadgets if vital. The car segment is additionally one of the application spaces where vehicle can be made keen by utilizing "IOT". So a vehicle following framework is additionally executed to screen development of vehicles remotely.
Thermal Radiation and Viscous Dissipation Effects on an Oscillatory Heat and ...rahulmonikasharma
An anticipated outcome that is intended chapter is to investigate effects of magnetic field on an oscillatory flow of a viscoelastic fluid with thermal radiation, viscous dissipation with Ohmic heating which bounded by a vertical plane surface, have been studied. Analytical solutions for the quasi – linear hyperbolic partial differential equations are obtained by perturbation technique. Solutions for velocity and temperature distributions are discussed for various values of physical parameters involving in the problem. The effects of cooling and heating of a viscoelastic fluid compared to the Newtonian fluid have been discussed.
Advance Approach towards Key Feature Extraction Using Designed Filters on Dif...rahulmonikasharma
In fast growing database repository system, image as data is one of the important concern despite text or numeric. Still we can’t replace test on any cost but for advancement, information may be managed with images. Therefore image processing is a wide area for the researcher. Many stages of processing of image provide researchers with new ideas to keep information safe with better way. Feature extraction, segmentation, recognition are the key areas of the image processing which helps to enhance the quality of working with images. Paper presents the comparison between image formats like .jpg, .png, .bmp, .gif. This paper is focused on the feature extraction and segmentation stages with background removal process. There are two filters, one is integer filter and second one is floating point Filter, which is used for the key feature extraction from image. These filters applied on the different images of different formats and visually compare the results.
Alamouti-STBC based Channel Estimation Technique over MIMO OFDM Systemrahulmonikasharma
The examination on various looks into on MIMO STBC framework in order to accomplish the higher framework execution is standard that the execution of the remote correspondence frameworks can be improved by usage numerous transmit and get radio wires, that is normally gathered on the grounds that the MIMO procedure, and has been incorporated. The Alamouti STBC might be a promising because of notice the pick up inside the remote interchanges framework misuse MIMO. To broaden the code rate and furthermore the yield of the symmetrical zone time square code for more than 4 transmit reception apparatuses is examined. The outlined framework is beated once forced with M-PSK (i.e upto 32-PSK) regulation. The channel estimation examine in these conditions.
Empirical Mode Decomposition Based Signal Analysis of Gear Fault Diagnosisrahulmonikasharma
A vibration investigation is about the specialty of searching for changes in the vibration example, and after that relating those progressions back to the machines mechanical outline. The level of vibration and the example of the vibration reveal to us something about the interior state of the turning segment. The vibration example can let us know whether the machine is out of adjust or twisted. Al-so blames with the moving components and coupling issues can be distinguished. This paper shows an approach for equip blame investigation utilizing signal handling plans. The information has been taken from college of ohio, joined states. The investigation has done utilizing MATLAB software.
This paper discusses a new algorithm of a univariate method, which is vitally important to develop a short-term load forecasting module for planning and operation of distribution system. It has many applications including purchasing of energy, generation and infrastructure development etc. We have discussed different time series forecasting approaches in this paper. But ARIMA has proved itself as the most appropriate method in forecasting of the load profile for West Bengal using the historical data of the year of 2017. Auto Regressive Integrated Moving Average model gives more accuracy level of load forecast than any other techniques. Mean Absolute Percentage Error (MAPE) has been calculated for the mentioned forecasted model.
Impact of Coupling Coefficient on Coupled Line Couplerrahulmonikasharma
The coupled line coupler is a type of directional coupler which finds practical utility. It is mainly used for sampling the microwave power. In this paper, 3 couplers A,B & C are designed with different values of coupling coefficient 6dB,10dB & 18dB respectively at a frequency of 2.5GHz using ADS tool. The return loss, isolation loss & transmission loss are determined. The design & simulation is done using microstrip line technology.
Design Evaluation and Temperature Rise Test of Flameproof Induction Motorrahulmonikasharma
The ignition of flammable gases, vapours or dust in presence of oxygen contained in the surrounding atmosphere may lead to explosion. Flameproof three phase induction motors are the most common and frequently used in the process industries such as oil refineries, oil rigs, petrochemicals, fertilizers, etc. The design of flameproof motor is such that it allows and sustain explosion within the enclosure caused by ignition of hazardous gases without transmitting it to the external flammable atmosphere. The enclosure is mechanically strong enough to withstand the explosion pressure developed inside it. To prevent an explosion due to hot spot on the surface of the motor, flameproof induction motors are subjected to heat run test to determine the maximum surface temperature and temperature class with respect to the ignition temperature of the surrounding flammable gas atmosphere. This paper highlights the design features of flameproof motors and their surface temperature classification for different sizes.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
1. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 220 – 223
_______________________________________________________________________________________________
220
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
On Cubic Graceful Labeling
Mathew Varkey T. K 1
,
1
Asst.Prof, Department of Mathematics,
T.K.M College of Engineering,
Kollam, Kerala, India
Email: mathewvarkeytk@gmail.com
Mini. S. Thomas 2
2
Research Scholar, Department of Mathematics
St. Albert’s College,
Eranakulam, Kerala, India
minirenjan1994@gmail.com
Abstract- A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled with distinct integers
{0,1,2,3,……..,m3
} such that for each edge f*
( uv) induces edge mappings are {13,
23
,33
,……,m3
}. A graph admits a cubic graceful labeling is
called a cubic graceful graph. In this paper, we proved that < K1,a , K1,b , K1c , K1,d>, associate urp with u(r+1)1 of K1,P, fixed vertices vr and ur
of two copies of Pn are cubic graceful.
Keywords: Cubic graceful graph, cubic graceful labeling, Path graph, Star graph,
__________________________________________________*****_________________________________________________
I. INTRODUCTION
Graphs labeling, where the vertices are assigned values subject to certain conditions, have often been motivated by practical
problems. Labeled graphs serves as useful mathematical models for a broad range of applications such as coding theory,
including the design of good radar type codes, missile guidance codes and convolution codes with optimal autocorrelation
properties. They facilitate the optimal nonstandard encoding of integers. For all terminology and notation in this paper we follow
Harary[1].
A function f is called a graceful labeling of a (p,q) graph G= (V,E) if f is an injection from the vertices of G to the set
{0,1,2,3,….q} such that, each edge uv is assigned the label |f(u)-f(v), the resulting edge labels are distinct. T. Tharmaraj and
P.B.Sarasija [5] introduced square graceful labeling concept in 2014. The concept of cubic graceful labeling of graphs was
introduced in [4]. A systematic presentation of survey of graph labeling is presented in [2]. We use the following definitions in the
subsequent sections.
Definition 1.1
The Path graph Pn is the n- vertex graph with n-1 edges, all on a single path.
Definition1.2
A complete bipartite graph K1,n is called a star and it has (n+1) vertices and n edges
Definition 1.3
The Trivial graph K1 or P1 is the graph with one vertex and no edges.
Definition 1.4
A graph G = (V,E) with n vertices and m edges is said be Cubic Graceful Graph (CGG) if there exists an injective function f:
V(G)→{0,1,2,……,m3
} such that the induced mapping f * : E(G)→ {13
,23
,……,m3
} defined by f *(uv): →|f(u)- f(v)| is a bijection .
The function f is called a Cubic Graceful Labeling (CGL) of G
3. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 220 – 223
_______________________________________________________________________________________________
222
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
The vertex labels are in the set {0,1,2, … . , [ 𝑎 + 𝑏 + 𝑐 + 𝑑 + 4 ]3
} Then the edge label arranged in the set
{13
, 23
, 33
, . . … … , (𝑎 + 𝑏 + 𝑐 + 𝑑 + 4)3
}. So the vertex labels are distinct and edge labels are also distinct and cubic. So the
graph G is cubic graceful for all 𝑎, 𝑏 , 𝑐, 𝑑 ≥ 1.
Theorem 2
If 𝐺𝑟 = 𝐾1,𝑝 be the given graph for 1 ≤ 𝑟 ≤ 𝑞 with vertex 𝑠𝑒𝑡 𝑉(𝐺𝑟 ) = 𝑢 𝑟, 𝑢 𝑟𝑠 ; 1 ≤ 𝑟 ≤ 𝑞, 1 ≤ 𝑠 ≤ 𝑝 Let G be the given
graph formulated by associate 𝑣𝑟𝑝 with 𝑣 𝑟+1 1 for 1 ≤ 𝑟 ≤ 𝑞 − 1. Then G is a cubic graceful for all p and q.
Proof :
The graph G consisting of the vertex set 𝑉(𝐺) = 𝑈𝑟, 𝑈𝑟𝑠 ; 1 ≤ 𝑟 ≤ 𝑞, 1 ≤ 𝑠 ≤ 𝑝 and the edge set E(G) = 𝑢 𝑟 𝑢 𝑟𝑠 ; 1 ≤ 𝑟 ≤
𝑞, 1≤ 𝑠≤ 𝑝
Then 𝑛 (𝐺) = 𝑝𝑞 and m(G) = pq
Let 𝑓: 𝑉(𝐺) → 0, 1, 2, 3, … … , 𝑝𝑞 3
be defined as follows.
𝑓(𝑢𝑖) = 0
𝑓 𝑢1,𝑠 = 𝑝𝑞 – 𝑠 + 1 3
; 1 ≤ 𝑠 ≤ 𝑝
𝑓 𝑢 𝑟 = 𝑓 𝑢 𝑟−1 𝑝 – 𝑝 𝑞– 𝑟 + 1 3
; 2 ≤ 𝑟 ≤ 𝑞
𝑓 𝑢 𝑟𝑠 = 𝑓 𝑢 𝑟 + [𝑞 – (𝑟– 1)𝑝 – (𝑠– 1) ]3
; 2 ≤ 𝑟 ≤ 𝑞 , 2 ≤ 𝑠 ≤ 𝑛
Then f induces a bijection
𝑓 ∗
𝑢 𝑟 𝑢 𝑟𝑠 = 𝑝𝑞– 𝑠 + 1 3
; 𝑟 = 1, 1 ≤ 𝑠 ≤ 𝑛
𝑓 ∗
(𝑢 𝑟 𝑢 𝑟−1 𝑝) = 𝑝 𝑞– 𝑟 + 1 3
, 2 ≤ 𝑟 ≤ 𝑝 , 𝑠 = 𝑝
𝑓 ∗
𝑢 𝑟 𝑢 𝑟𝑠 = 𝑝 𝑞– 𝑟 + 1 − 𝑖 3
; 2 ≤ 𝑟 ≤ 𝑞 , 2 ≤ 𝑠 ≤ 𝑝 1 ≤ 𝑖 ≤ 𝑝 – 1,
The vertex labels are in the set 0, 1, 2 … … 𝑝𝑞 3
. Then the edge label arranged in the set 13
, 23
, … … . . (𝑝𝑞)3
. So the vertex
labels are distinct and edge labels are also distinct and cubic. So the graph G is cubic graceful for all 𝑝, 𝑞 ≥ 1.
Theorem 3
Let G be the graph obtained from two copies of Pn with vertices v1, v2,.... ,vn and u1, u2, u3... ,un by joining the fixed vertices vr and
ur by means of an edge, for 1≤r≤n. Then the graph (Pn: G) is cubic graceful.
Proof: Let G denote the graph (Pn: G)
Let V(G) = 𝑢𝑖 𝑓𝑜𝑟 𝑖 = 1,2,3, … … … , 𝑛– 1
𝑣𝑖 𝑓𝑜𝑟 𝑖 = 1,2,3, . . . . . . . . , (𝑛– 1)
and E(G)= 𝑢𝑖 𝑢𝑖 for 𝑖 = 1,2,3. . . . . . . . . (𝑛– 1)
𝑣𝑖 𝑣𝑖++1 for 𝑖 = 1,2,3. . . . . . . . . . , (𝑛– 1)
𝑢 𝑟 𝑣𝑟 for 𝑟 = 1,2, . . . . . . . . , 𝑛 where `𝑟` is a fixed vertex
4. International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 8 220 – 223
_______________________________________________________________________________________________
223
IJRITCC | August 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
So, 𝑝 = 2𝑛 and 𝑞 = 2𝑛– 1
Define 𝑓: 𝑉(𝐺) → 0,1,2, … . . , (2𝑛 + 1)3
by
𝑓 (𝑢𝑖) = 0
𝑓(𝑢𝑖+1) = (– 1) 𝑘+1𝑖
𝑘=1 (2𝑛– 𝑘)3
for 𝑖 = 1, 2, . . . . . , (𝑛 + 1)
𝑓 (𝑣𝑟 ) = 𝑓(𝑢 𝑟) – 𝑛3
; for 𝑟 = 1,2, . . . . . , 𝑛 and it is a fixed vertex.
𝑓 (𝑣𝑟 − 𝑗) = 𝑓(𝑣𝑟 ) + (– 1) 𝐾𝑗
𝑘=1 (𝑛– 𝑟 + 𝑗)3
; for 𝑗 = 1,2, . . . . . , (𝑟– 1)
𝑓 (𝑣𝑟 + 𝑗) = 𝑓(𝑣𝑟 ) + (– 1) 𝐾𝑗
𝑘=1 (𝑛– 𝑟– 𝑗 + 1)3
; for 𝑗 = 1,2, . . . . . , (𝑛– 𝑟)
The induced edge mapping are
𝑓∗
(𝑢𝑖 𝑢𝑖+1 + 1) = (2𝑛– 𝑖)3
for 𝑖 = 1,2, . . . . . , (𝑛– 1)
𝑓∗
(𝑢 𝑟 𝑣𝑟 ) = 𝑛3
for 𝑟 = 1,2, . . . . . , 𝑛; where ‘𝑟’ is a fixed vertex
𝑓∗
(𝑣𝑖 𝑣𝑖+1) = (𝑛– 1)3
for 𝑖 = 1,2, . . . . . . , (𝑛– 1)
The vertex labels are in the set 0,1,2 … . (2𝑛– 1)3
. Then the edge labels are arranged in the set 13
, 23
, 33
… . (2𝑛– 1)3
So the
vertex labels are distinct and the edge labels are also cubic and distinct . So the graph (Pn:G)) is a cubic graceful.
REFERENCES
[1] Frank Harary, Graph Theory, Narosa Publishing House, New Delhi, 2001[6]
[2] J.A . Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatrorics,(2016)
[3] V.J.Kaneria and H.M.Makadia, Some Graceful Graphs J. of Math. Research, 4 (1),(2012) 54-57
[4] Mini.S.Thomas and Mathew Varkey T.K, Cubic Graceful Labeling . Global Journal of Pure And Applied Mathematics, June (2017)
[5] T. Tharmaraj and P.B.Sarasija, International Journal of Mathematics and Soft Computing Vol.4 No.1(2014).129-137.