Eddie Cheng

Orcid: 0000-0003-4526-7983

Affiliations:
  • Oakland University, Rochester, Michigan, USA


According to our database1, Eddie Cheng authored at least 175 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Characterization of Cyclic Diagnosability of Regular Diagnosable Networks.
IEEE Trans. Reliab., March, 2024

A Commentary on the Progress of Big Data in Combinatorial Optimization.
Parallel Process. Lett., March, 2024

The Cyclic Diagnosability Of Hypercubes Under The PMC Model And The MM* Model.
Comput. J., February, 2024

2023
On the <i>g</i>-extra connectivity of augmented cubes.
Theor. Comput. Sci., August, 2023

Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs.
Comput. J., May, 2023

Component connectivity of augmented cubes.
Theor. Comput. Sci., March, 2023

Reliability analysis of the generalized balanced hypercube.
Theor. Comput. Sci., 2023

Conditional strong matching preclusion of the pancake graph.
Int. J. Parallel Emergent Distributed Syst., 2023

Restricted connectivity of Cayley graph generated by transposition trees.
Discret. Appl. Math., 2023

Constructing disjoint Steiner trees in Sierpiński graphs.
CoRR, 2023

2022
Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs.
Int. J. Comput. Math. Comput. Syst. Theory, October, 2022

On the <i>g</i>-extra diagnosability of enhanced hypercubes.
Theor. Comput. Sci., 2022

Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks.
Theor. Comput. Sci., 2022

A general approach to deriving diagnosability results of interconnection networks.
Int. J. Parallel Emergent Distributed Syst., 2022

A Note on Linearly Many Faults of Interconnection Networks.
J. Interconnect. Networks, 2022

A note on maximum fractional matchings of graphs.
J. Comb. Optim., 2022

Fractional matching preclusion number of graphs.
Discret. Appl. Math., 2022

Characterization of component diagnosability of regular networks.
Discret. Appl. Math., 2022

2021
Reliability analysis of the cactus-based networks.
Theor. Comput. Sci., 2021

Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction.
Parallel Process. Lett., 2021

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree.
Math. Comput. Sci., 2021

Super spanning connectivity of split-star networks.
Inf. Process. Lett., 2021

Persistence of Hybrid Diagnosability of Regular Networks Under Testing Diagnostic Model.
Comput. J., 2021

Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract).
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Structure and Substructure Connectivity of Hypercube-Like Networks.
Parallel Process. Lett., 2020

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks.
Parallel Process. Lett., 2020

Preface.
Parallel Process. Lett., 2020

Diagnosability of interconnection networks: past, present and future.
Int. J. Parallel Emergent Distributed Syst., 2020

Preface.
Int. J. Parallel Emergent Distributed Syst., 2020

A note on the strong matching preclusion problem for data center networks.
Inf. Process. Lett., 2020

Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements.
Int. J. Found. Comput. Sci., 2020

Reliability and conditional diagnosability of hyper bijective connection networks.
Int. J. Comput. Math. Comput. Syst. Theory, 2020

The g-extra diagnosability of the generalized exchanged hypercube.
Int. J. Comput. Math. Comput. Syst. Theory, 2020

2-spanning cyclability problems of the some generalized Petersen graphs.
Discuss. Math. Graph Theory, 2020

Note on Applications of Linearly Many Faults.
Comput. J., 2020

Two Algorithms for Constructing Independent Spanning Trees in (n, k)-Star Graphs.
IEEE Access, 2020

2019
Matching preclusion number of graphs.
Theor. Comput. Sci., 2019

Matching preclusion number in product graphs.
Theor. Comput. Sci., 2019

A note on generalized matching preclusion in bipartite graphs.
Theor. Comput. Sci., 2019

Strongly Menger connectedness of data center network and (<i>n</i>, <i>k</i>)-star graph.
Theor. Comput. Sci., 2019

A general approach to deriving the <i>g</i>-good-neighbor conditional diagnosability of interconnection networks.
Theor. Comput. Sci., 2019

A Note on the Steiner <i>k</i>-Diameter of Tensor Product Networks.
Parallel Process. Lett., 2019

Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles.
Parallel Process. Lett., 2019

A Concise Survey of Matching Preclusion in Interconnection Networks.
J. Interconnect. Networks, 2019

Preface.
J. Interconnect. Networks, 2019

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs.
J. Inf. Sci. Eng., 2019

Strong matching preclusion problem of the folded Petersen cube.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

Introduction.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

Fractional matching preclusion for generalized augmented cubes.
Discret. Math. Theor. Comput. Sci., 2019

Two kinds of generalized connectivity of dual cubes.
Discret. Appl. Math., 2019

Fractional matching preclusion for arrangement graphs.
Discret. Appl. Math., 2019

Minimum degree and size conditions for the proper connection number of graphs.
Appl. Math. Comput., 2019

Structural Properties and Fault Resiliency of Interconnection Networks.
Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019

2018
Strong matching preclusion number of graphs.
Theor. Comput. Sci., 2018

Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks.
Theor. Comput. Sci., 2018

Fractional Matching Preclusion for (<i>n</i>, <i>k</i>)-Star Graphs.
Parallel Process. Lett., 2018

Matching Preclusion for the Shuffle-Cubes.
Parallel Process. Lett., 2018

A note on the Steiner -diameter of a graph.
Int. J. Comput. Math. Comput. Syst. Theory, 2018

A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs.
Graphs Comb., 2018

Steiner Distance in Product Networks.
Discret. Math. Theor. Comput. Sci., 2018

The k-independence number of graph products.
Art Discret. Appl. Math., 2018

Fault-Hamiltonicity of Cartesian products of directed cycles.
Art Discret. Appl. Math., 2018

Fractional Matching Preclusion for (Burnt) Pancake Graphs.
Proceedings of the 15th International Symposium on Pervasive Systems, 2018

2017
On the restricted connectivity of the arrangement graph.
J. Supercomput., 2017

Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions.
Parallel Process. Lett., 2017

On Diagnosability of Interconnection Networks.
Int. J. Unconv. Comput., 2017

Diagnosability problems of the exchanged hypercube and its generalization.
Int. J. Comput. Math. Comput. Syst. Theory, 2017

On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs.
Graphs Comb., 2017

A strong connectivity property of the generalized exchanged hypercube.
Discret. Appl. Math., 2017

Proper distance in edge-colored hypercubes.
Appl. Math. Comput., 2017

Steiner Distance in Join, Corona and Threshold Graphs.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

A Study of the Decycling Problem for the Generalized Exchanged Hypercube.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

2016
Strong matching preclusion of (n, k)-star graphs.
Theor. Comput. Sci., 2016

On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks.
Parallel Process. Lett., 2016

Strong matching preclusion of burnt pancake graphs.
Int. J. Parallel Emergent Distributed Syst., 2016

Strong Matching Preclusion of Arrangement Graphs.
J. Interconnect. Networks, 2016

Length two path centered surface areas of the (n, k)-star graph.
Inf. Sci., 2016

2015
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model.
ACM Trans. Design Autom. Electr. Syst., 2015

Matching preclusion and conditional matching preclusion problems for the folded Petersen cube.
Theor. Comput. Sci., 2015

Linearly Many Edge-Faults in 2-Bijective Connection Networks.
Parallel Process. Lett., 2015

Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults.
J. Interconnect. Networks, 2015

On Hamiltonian properties of unidirectional hypercubes.
Inf. Process. Lett., 2015

Conditional Matching Preclusion For The Star Graphs.
Ars Comb., 2015

2014
Deriving length two path centered surface area for the arrangement graph: a generating function approach.
J. Supercomput., 2014

On the conditional diagnosability of matching composition networks.
Theor. Comput. Sci., 2014

Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs.
Int. J. Parallel Emergent Distributed Syst., 2014

The edge-centered surface area of the arrangement graph.
J. Comb. Optim., 2014

Length two path-centred surface areas for the arrangement graph.
Int. J. Comput. Math., 2014

The number of shortest paths in the (n, k)-star graph.
Discret. Math. Algorithms Appl., 2014

Conditional Fault Hamiltonicity of the Star Graph.
Ars Comb., 2014

On the Surface Areas of the Alternating Group Graph and the Split-Star Graph.
Ars Comb., 2014

Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013
Strong matching preclusion for augmented cubes.
Theor. Comput. Sci., 2013

Linearly many faults in dual-cube-like networks.
Theor. Comput. Sci., 2013

The <i>Q<sub>N, k, M</sub></i> Graph: a Common Generalization of Various Popular Interconnection Networks.
Parallel Process. Lett., 2013

Conditional Matching preclusion for (n, k)-Star Graphs.
Parallel Process. Lett., 2013

Linearly many faults in augmented cubes.
Int. J. Parallel Emergent Distributed Syst., 2013

Linearly many faults in arrangement graphs.
Networks, 2013

4-ordered-Hamiltonian problems of the generalized Petersen graph <i>GP</i>(<i>n</i>, 4).
Math. Comput. Model., 2013

Strong Matching preclusion of Pancake graphs.
J. Interconnect. Networks, 2013

Diagnosability of Cayley graphs generated by transposition trees with missing edges.
Inf. Sci., 2013

The number of shortest paths in the arrangement graph.
Inf. Sci., 2013

Strong local diagnosability of (<i>n</i>, <i>k</i>)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges.
Inf. Process. Lett., 2013

A Faster Algorithm for Finding Disjoint Ordering of Sets.
Int. J. Netw. Comput., 2013

Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees.
Graphs Comb., 2013

A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs.
Comput. J., 2013

2012
Topological properties of folded hyper-star networks.
J. Supercomput., 2012

On the surface area of the augmented cubes.
J. Supercomput., 2012

A note on the alternating group network.
J. Supercomput., 2012

Matching preclusion and Conditional Matching preclusion for Crossed Cubes.
Parallel Process. Lett., 2012

Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars.
Networks, 2012

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions.
Networks, 2012

A Unified Approach to the Conditional Diagnosability of Interconnection Networks.
J. Interconnect. Networks, 2012

On deriving conditional diagnosability of interconnection networks.
Inf. Process. Lett., 2012

Component connectivity of the hypercubes.
Int. J. Comput. Math., 2012

Solution to an open problem on 4-ordered Hamiltonian graphs.
Discret. Math., 2012

One-to-many node-disjoint paths of hyper-star networks.
Discret. Appl. Math., 2012

Matching preclusion and conditional matching preclusion for regular interconnection networks.
Discret. Appl. Math., 2012

Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products.
Discret. Appl. Math., 2012

2011
Optimal Independent Spanning Trees on Odd Graphs.
J. Supercomput., 2011

Conditional matching preclusion for the arrangement graphs.
Theor. Comput. Sci., 2011

On the Surface Areas and Average Distances of Meshes and Tori.
Parallel Process. Lett., 2011

Strong Matching preclusion for the Alternating Group Graphs and Split-Stars.
J. Interconnect. Networks, 2011

Independent spanning trees on even networks.
Inf. Sci., 2011

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees.
Inf. Sci., 2011

Linearly Many Faults in (n, k)-Star Graphs.
Int. J. Found. Comput. Sci., 2011

A note on embeddings among folded hypercubes, even graphs and odd graphs.
Int. J. Comput. Math., 2011

Conditional matching preclusion for the alternating group graphs and split-stars.
Int. J. Comput. Math., 2011

On the edge-connectivity of graphs with two orbits of the same size.
Discret. Math., 2011

Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database.
Proceedings of the World Congress on Services, 2011

On the Surface Area of the Asymmetric Twisted Cube.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Linearly many faults in 2-tree-generated networks.
Networks, 2010

4-Ordered Hamiltonicity for Some Chordal Ring Graphs.
J. Interconnect. Networks, 2010

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.
J. Interconnect. Networks, 2010

Matching preclusion and Conditional Matching preclusion for Augmented Cubes.
J. Interconnect. Networks, 2010

Distance formula and shortest paths for the (n, k)-star graphs.
Inf. Sci., 2010

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs.
Int. J. Comput. Math., 2010

Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs.
Int. J. Comput. Math., 2010

The Number of Shortest Paths in the (<i>n</i>, <i>k</i>)-Star Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
On the surface area of the (n, k)-star graph.
Theor. Comput. Sci., 2009

A short note on the surface area of star graphs.
Parallel Process. Lett., 2009

A Generating Function Approach to the Surface Areas of Some Interconnection Networks.
J. Interconnect. Networks, 2009

Conditional matching preclusion sets.
Inf. Sci., 2009

Embedding hypercubes, rings, and odd graphs into hyper-stars.
Int. J. Comput. Math., 2009

On Disjoint Shortest Paths Routing on the Hypercube.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Hamiltonian connectivity of 2-tree-generated networks.
Math. Comput. Model., 2008

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.
J. Interconnect. Networks, 2008

Matching preclusion for Alternating Group Graphs and their Generalizations.
Int. J. Found. Comput. Sci., 2008

Strong structural properties of unidirectional star graphs.
Discret. Appl. Math., 2008

Orienting Cayley graphs generated by transposition trees.
Comput. Math. Appl., 2008

2007
Matching preclusion for some interconnection networks.
Networks, 2007

Linearly many faults in Cayley graphs generated by transposition trees.
Inf. Sci., 2007

Fault Resiliency of Cayley Graphs Generated by Transpositions.
Int. J. Found. Comput. Sci., 2007

2006
Structural Properties Of Hyper-Stars.
Ars Comb., 2006

2005
Maximal vertex-connectivity of.
Networks, 2005

2004
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
Oper. Res. Lett., 2004

2003
Time-stamped Graphs and Their Associated Influence Digraphs.
Discret. Appl. Math., 2003

2002
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes.
SIAM J. Discret. Math., 2002

Increasing the connectivity of the star graphs.
Networks, 2002

Antiweb-wheel inequalities and their separation problems over the stable set polytopes.
Math. Program., 2002

Unidirectional <i>(n, k)</i>-Star Graphs.
J. Interconnect. Networks, 2002

Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes.
Electron. Notes Discret. Math., 2002

Basic Structures of Some Interconnection Networks.
Electron. Notes Discret. Math., 2002

Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2002

Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness.
Discret. Appl. Math., 2002

Flow Formulations for the Student Scheduling Problem.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2001
Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars.
Ars Comb., 2001

2000
Orienting split-stars and alternating group graphs.
Networks, 2000

On the Day-Tripathi orientation of the star graphs: Connectivity.
Inf. Process. Lett., 2000

1999
Successive edge-connectivity augmentation problems.
Math. Program., 1999

Edge-augmentation of hypergraphs.
Math. Program., 1999

1998
Separating subdivision of bicycle wheel inequalities over cut polytopes.
Oper. Res. Lett., 1998

1997
Wheel inequalitites for stable set polytopes.
Math. Program., 1997

1995
Separation Problems for the Stable Set Polytope.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
A Faster Algorithm for Computing the Strength of a Network.
Inf. Process. Lett., 1994


  Loading...