2013International journal of mathematics and computationRequires access

Operations on graphs and folding of some special graphs

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

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Mathematics, Combinatorics, Chordal graph, Indifference graph, Line graph, Block graph, Split graph, Dual graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Operations on graphs and folding of some special graphs — Research Paper | ScholarLens