Folding List of Graphs Obtained from a Given Graph
In this paper, we examine the relation between graph folding of a given graph and foldings of new graphs obtained from this graph by some techniques like dual, gear, subdivision, web, crown, simplex, crossed prism, and clique-sum graphs. In each case, we obtained the necessary and sufficient conditi...
Saved in:
Main Authors: | E. M. El-Kholy, H. Ahmed |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2020/1316497 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Number of Blocks of a Graph with Given Minimum Degree
by: Lei Li, et al.
Published: (2021-01-01) -
On the Resistance-Harary Index of Graphs Given Cut Edges
by: Hongzhuan Wang, et al.
Published: (2017-01-01) -
The Harary Index of All Unicyclic Graphs with Given Diameter
by: Bao-Hua Xing, et al.
Published: (2018-01-01) -
The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number
by: Luozhong Gong, et al.
Published: (2022-01-01) -
PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS
by: Lê Xuân Hùng
Published: (2020-05-01)