The Very Cost Effective Graph Folding of the Join of Two Graphs

Journal Title: Asian Research Journal of Mathematics - Year 2017, Vol 7, Issue 4

Abstract

In this paper we studied the very cost effective graph property for the join graph of two graphs. In general this is may or may not be a very cost effective graph. We obtained the conditions for the join graph of two graphs to be a very cost effective graph. First we proved that the join graph P_n∨P_m of path graphs is very cost effective graph if n+m is an even number and is not if n+m is an odd number. Then we proved that the join graph of any two cycle graphs C_n and C_m where n ,m are both odd is very cost effective, and the join graph P_n∨C_n is a very cost effective graph if n is an odd number. Also we proved that the join graph G_1∨G_2 of two very cost effective graphs G_1 and G_2 is a very cost effective graph if 〖n(G〗_1)+n(G_2) is even. Finally we proved that the graph folding of the join graph of two very cost effective graphs not always very cost effective but this will be the case if the sum of the numbers of the vertices in the image of the graph folding is even.

Authors and Affiliations

E. M. El-Kholy, H. Ahmed

Keywords

Related Articles

Using the Logistic Function to Illustrate Periodic Orbits as Recurrent Formation

Recurrence as behaviour in the dynamical system is also a state which happens as a result of an outcome of a point which does return to its initial state. But in dynamical system the most simple and easy way to study reg...

Numerical Solutions for Solving the Modeling Differential Equations

In this paper, we will solve the Logistic and Riccati differential equations using VIM, shifted Chebyshev-spectral fourth kind methods and Hermite collocation method. Where we can from the numerical results we obtained t...

A Simple Model of Sediment Transport in the Nearshore Zone

In this paper we examine a simple model of sediment transport, induced by the breaking waves in the surf zone. Essentially the bottom is allowed to move in response to the divergence of a sediment flux, in turn determine...

The 19 Densities of the Hierarchical Bayes Model with Two Conditional Levels

There are 19 densities involved in the hierarchical Bayes model with two conditional levels, in which the 3 densities, that is, the likelihood function, the first level prior density, and the secondlevel prior density, a...

Conditional Least Squares Estimation for Discretely Sampled Nonergodic Di usions

Strong consistency and conditional asymptotic normality of the conditional least squares estimator of a parameter appearing nonlinearly in the time dependent drift coefficient of the Itˆo stochastic differential equation...

Download PDF file
  • EP ID EP338464
  • DOI 10.9734/ARJOM/2017/37640
  • Views 70
  • Downloads 0

How To Cite

E. M. El-Kholy, H. Ahmed (2017). The Very Cost Effective Graph Folding of the Join of Two Graphs. Asian Research Journal of Mathematics, 7(4), 1-13. https://europub.co.uk./articles/-A-338464