Open Access Open Access  Restricted Access Subscription or Fee Access

On Very Cost Effective graphs and Its Folding

Mohamed R. Zeen El Deen, Ahmed A. Essawy


The aim of this paper is to discuss and describe Very cost effective graphs by using adjacent matrix and chromatic number. We show how to get a new very cost effective graph from old ones by using the graph operations. We find the condition for the tensor product of two graphs to be a very cost effective graph, also we study the union and normal product of two graphs. Then we study the folding of the very cost effective graph and show that the folding of the very cost effective graph not always very costly . Theorems governing these types of foldings are achieved.


Graph operation, Graph folding, Very cost effective graph.

Full Text:


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.