Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is known that edge disjoint paths is closely related to the edge connectivity and the multicommodity flow problems. ,  study the edge disjoint paths in hypercubes and folded hypercubes with edge faults.  first introduce the  F -strongly Menger edge connectivity of a graph, and  show that in all  n   -dimensional hypercubes (folded hypercubes, respectively) with at most   2n−4(2n−2,      2  n  −  4  (  2  n  −  2  ,         respectively) edges removed, if each vertex has at least two fault-free adjacent vertices, then every pair of vertices  u  and  v  are connected by  min { deg ( u ),  deg ( v )} edge disjoint paths, where  deg ( u ) and  deg ( v ) are the remaining degree of vertices  u  and  v , respectively.
['Yalin Qiao', 'Weihua Yang']
I am writing a research paper on a idea Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
[{"from": "human", "value": "I am writing a research paper on a idea Edge disjoint paths in hypercubes and folded hypercubes with conditional faults"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is known that edge disjoint paths is closely related to the edge connectivity and the multicommodity flow problems. ,  study the edge disjoint paths in hypercubes and folded hypercubes with edge faults.  first introduce the  F -strongly Menger edge connectivity of a graph, and  show that in all  n \u00a0 -dimensional hypercubes (folded hypercubes, respectively) with at most   2n\u22124(2n\u22122,      2  n  \u2212  4  (  2  n  \u2212  2  ,         respectively) edges removed, if each vertex has at least two fault-free adjacent vertices, then every pair of vertices  u  and  v  are connected by  min { deg ( u ),  deg ( v )} edge disjoint paths, where  deg ( u ) and  deg ( v ) are the remaining degree of vertices  u  and  v , respectively."}]