Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let G=(V,E) be an k-connected graph. The (k?1)-fault-tolerant diameter of G, denoted by D k (G), is defined as D k (G)=max?{d(G?F)|F?V(G) and |F|=k?1}, where G?F denotes the subgraph induced by V(G)?F. The fault-tolerant diameter is one important parameter for measuring the reliability and efficiency of interconnection networks. ,  will give the bounds of fault-tolerant diameter of three family interconnection networks.
['Tongliang Shi', 'Mei Lu']
I am writing a research paper on a idea Fault-tolerant diameter for three family interconnection networks
[{"from": "human", "value": "I am writing a research paper on a idea Fault-tolerant diameter for three family interconnection networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Let G=(V,E) be an k-connected graph. The (k?1)-fault-tolerant diameter of G, denoted by D k (G), is defined as D k (G)=max?{d(G?F)|F?V(G) and |F|=k?1}, where G?F denotes the subgraph induced by V(G)?F. The fault-tolerant diameter is one important parameter for measuring the reliability and efficiency of interconnection networks. ,  will give the bounds of fault-tolerant diameter of three family interconnection networks."}]