Operations on graphs and folding of some special graphs
E. M. El-Kholy, El-Said R. Lashin, S. N. Daoud
Abstract
E. M. El-Kholy, El-Said R. Lashin, S. N. Daoud
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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