Open Access Open Access  Restricted Access Subscription or Fee Access

Operations on graphs and folding of some special graphs

E.M. El-Kholy, El-Said R. Lashin, S. N. Daoud


In this paper we examining the relation between folding of a given graph and folding of new graphs generating from this graph by some known operations like line, dual, clique, closure and kth power of this graph. Also we discussed folding of some special graphs like, Hamiltonian, perfect, and triangulated graphs.


Line graph, Clique graph, Dual graph, Hamiltonian graph, and Perfect 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.