Eddie Cheng

From MaRDI portal
Person:294706

Available identifiers

zbMath Open cheng.eddieMaRDI QIDQ294706

List of research outcomes

PublicationDate of PublicationType
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs2024-03-27Paper
https://portal.mardi4nfdi.de/entity/Q61213062024-02-26Paper
Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs2023-10-25Paper
On the \(g\)-extra connectivity of augmented cubes2023-08-08Paper
Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)2023-03-30Paper
Component connectivity of augmented cubes2023-03-24Paper
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs2023-02-21Paper
Restricted connectivity of Cayley graph generated by transposition trees2023-01-11Paper
Reliability analysis of the generalized balanced hypercube2022-12-21Paper
Fault diagnosability of regular graphs2022-12-15Paper
On the extraconnectivity of arrangement graphs2022-10-22Paper
Characterization of component diagnosability of regular networks2022-10-13Paper
Separation problems for the stable set polytope2022-08-30Paper
Matching Preclusion for the Shuffle-Cubes2022-07-08Paper
Structure and Substructure Connectivity of Hypercube-Like Networks2022-07-08Paper
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks2022-07-08Paper
Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction2022-07-08Paper
Fractional Matching Preclusion for (n,k)-Star Graphs2022-07-04Paper
A Note on the Steinerk-Diameter of Tensor Product Networks2022-07-04Paper
Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles2022-07-04Paper
On the \(g\)-extra diagnosability of enhanced hypercubes2022-05-23Paper
A general approach to deriving diagnosability results of interconnection networks2022-04-06Paper
Fractional matching preclusion number of graphs2022-03-04Paper
Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks2022-02-21Paper
A note on maximum fractional matchings of graphs2022-02-14Paper
Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree2022-01-28Paper
Reliability analysis of the cactus-based networks2021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49871722021-04-28Paper
A note on the strong matching preclusion problem for data center networks2020-10-07Paper
2-spanning cyclability problems of some generalized Petersen graphs2020-04-28Paper
Conditional Strong Matching Preclusion of the Alternating Group Graph2020-02-03Paper
Fractional matching preclusion for generalized augmented cubes2020-01-13Paper
Matching Preclusion of the Generalized Petersen Graph2019-12-13Paper
Minimum degree and size conditions for the proper connection number of graphs2019-11-27Paper
Strongly Menger connectedness of data center network and \((n,k)\)-star graph2019-11-13Paper
Fractional matching preclusion for arrangement graphs2019-11-06Paper
The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products2019-10-02Paper
Fault-Hamiltonicity of Cartesian products of directed cycles2019-10-02Paper
A note on generalized matching preclusion in bipartite graphs2019-09-10Paper
https://portal.mardi4nfdi.de/entity/Q52247322019-07-24Paper
https://portal.mardi4nfdi.de/entity/Q52247352019-07-24Paper
https://portal.mardi4nfdi.de/entity/Q52247362019-07-24Paper
https://portal.mardi4nfdi.de/entity/Q52247372019-07-24Paper
Generalized Matching Preclusion in Bipartite Graphs2019-07-22Paper
Proper distance in edge-colored hypercubes2019-04-29Paper
Two kinds of generalized connectivity of dual cubes2019-03-11Paper
Matching preclusion number in product graphs2019-02-14Paper
A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks2019-01-18Paper
Matching preclusion number of graphs2019-01-18Paper
Steiner Distance in Product Networks2018-12-10Paper
Structural Properties of Generalized Exchanged Hypercubes2018-10-04Paper
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks2018-06-07Paper
Length two path centered surface areas of the \((n, k)\)-star graph2018-05-22Paper
https://portal.mardi4nfdi.de/entity/Q46361922018-04-23Paper
A complete classification of which \((n,k)\)-star graphs are Cayley graphs2018-03-22Paper
Strong matching preclusion number of graphs2018-02-06Paper
Linearly Many Edge-Faults in 2-Bijective Connection Networks2017-12-15Paper
On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks2017-12-15Paper
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions2017-12-15Paper
Infinitely many equivalent versions of the graceful tree conjecture2017-07-19Paper
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs2017-06-29Paper
https://portal.mardi4nfdi.de/entity/Q29712572017-04-04Paper
A strong connectivity property of the generalized exchanged hypercube2017-03-15Paper
The Steiner (n-3)-diameter of a graph2017-03-11Paper
On the conditional diagnosability of matching composition networks2016-06-27Paper
On the Day-Tripathi orientation of the star graphs: connectivity2016-06-16Paper
https://portal.mardi4nfdi.de/entity/Q28099322016-05-30Paper
https://portal.mardi4nfdi.de/entity/Q28048522016-05-04Paper
https://portal.mardi4nfdi.de/entity/Q27998362016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q27919762016-03-16Paper
Strong matching preclusion of \((n,k)\)-star graphs2016-01-21Paper
Diagnosability of Cayley graphs generated by transposition trees with missing edges2015-09-23Paper
The number of shortest paths in the arrangement graph2015-09-23Paper
https://portal.mardi4nfdi.de/entity/Q55023912015-08-26Paper
https://portal.mardi4nfdi.de/entity/Q52519722015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q52520222015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q52520452015-05-21Paper
On Hamiltonian properties of unidirectional hypercubes2015-05-21Paper
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube2015-05-18Paper
4-ordered-Hamiltonian problems of the generalized Petersen graph image2015-02-19Paper
https://portal.mardi4nfdi.de/entity/Q29367062015-01-06Paper
The number of shortest paths in the (n, k)-star graph2014-11-28Paper
https://portal.mardi4nfdi.de/entity/Q29277732014-11-04Paper
Length two path-centred surface areas for the arrangement graph2014-10-14Paper
Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges2014-08-13Paper
CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS2014-04-10Paper
THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q54054392014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54054552014-04-02Paper
The edge-centered surface area of the arrangement graph2014-02-25Paper
https://portal.mardi4nfdi.de/entity/Q28693802014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q28693932014-01-03Paper
Strong matching preclusion for augmented cubes2013-12-17Paper
Linearly many faults in arrangement graphs2013-08-06Paper
Cyclic vertex-connectivity of Cayley graphs generated by transposition trees2013-07-19Paper
Linearly many faults in dual-cube-like networks2013-03-04Paper
ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI2012-12-12Paper
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES2012-12-12Paper
The Edge-Centered Surface Area of the Arrangement Graph2012-11-02Paper
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions2012-09-21Paper
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars2012-09-21Paper
LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS2012-08-29Paper
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products2012-08-14Paper
Matching preclusion and conditional matching preclusion for regular interconnection networks2012-08-10Paper
One-to-many node-disjoint paths of hyper-star networks2012-08-10Paper
Solution to an open problem on 4-ordered Hamiltonian graphs2012-08-10Paper
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees2012-07-13Paper
Component connectivity of the hypercubes2012-05-15Paper
https://portal.mardi4nfdi.de/entity/Q31100782012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q31100922012-01-26Paper
Conditional matching preclusion for the arrangement graphs2012-01-09Paper
On the Surface Area of the Asymmetric Twisted Cube2011-08-12Paper
On the edge-connectivity of graphs with two orbits of the same size2011-08-08Paper
https://portal.mardi4nfdi.de/entity/Q30156092011-07-13Paper
Independent spanning trees on even networks2011-06-22Paper
A note on embeddings among folded hypercubes, even graphs and odd graphs2011-04-21Paper
Conditional matching preclusion for the alternating group graphs and split-stars2011-04-21Paper
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs2011-01-20Paper
The Number of Shortest Paths in the (n, k)-Star Graphs2011-01-08Paper
FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS2011-01-06Paper
Linearly many faults in 2-tree-generated networks2010-11-24Paper
Matching preclusion for the (n, k)-bubble-sort graphs2010-11-12Paper
A short note on the surface area of star graphs2010-09-29Paper
https://portal.mardi4nfdi.de/entity/Q35819292010-09-02Paper
Distance formula and shortest paths for the \((n,k)\)-star graphs2010-06-11Paper
On the surface area of the \((n,k)\)-star graph2009-11-25Paper
On Disjoint Shortest Paths Routing on the Hypercube2009-07-07Paper
Embedding hypercubes, rings, and odd graphs into hyper-stars2009-05-29Paper
https://portal.mardi4nfdi.de/entity/Q36166592009-03-26Paper
Conditional matching preclusion sets2009-03-25Paper
https://portal.mardi4nfdi.de/entity/Q36159112009-03-24Paper
Hamiltonian connectivity of 2-tree-generated networks2009-03-23Paper
Strong structural properties of unidirectional star graphs2009-03-09Paper
MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS2009-02-26Paper
On the Surface Area of the (n, k)-Star Graph2009-01-27Paper
Orienting Cayley graphs generated by transposition trees2008-09-11Paper
https://portal.mardi4nfdi.de/entity/Q54431722008-02-20Paper
Linearly many faults in Cayley graphs generated by transposition trees2007-10-18Paper
Matching preclusion for some interconnection networks2007-09-21Paper
https://portal.mardi4nfdi.de/entity/Q34295492007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34286662007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q33783102006-03-30Paper
Maximal vertex-connectivity of2006-01-23Paper
https://portal.mardi4nfdi.de/entity/Q57085642005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57085652005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57085662005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54608812005-07-20Paper
https://portal.mardi4nfdi.de/entity/Q46779182005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q46779792005-05-23Paper
https://portal.mardi4nfdi.de/entity/Q44727042004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44647922004-05-27Paper
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.2004-01-05Paper
https://portal.mardi4nfdi.de/entity/Q44308652003-10-13Paper
Time-stamped graphs and their associated influence digraphs2003-06-10Paper
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes2003-01-05Paper
Increasing the connectivity of the star graphs2002-12-17Paper
https://portal.mardi4nfdi.de/entity/Q43291552002-10-24Paper
https://portal.mardi4nfdi.de/entity/Q45292992002-10-10Paper
Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness2002-06-24Paper
Antiweb-wheel inequalities and their separation problems over the stable set polytopes2002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q44058002002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q27183632001-11-22Paper
https://portal.mardi4nfdi.de/entity/Q27166702001-10-21Paper
Separating subdivision of bicycle wheel inequalities over cut polytopes2001-02-09Paper
Successive edge-connectivity augmentation problems2000-07-10Paper
https://portal.mardi4nfdi.de/entity/Q49533232000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49497932000-05-07Paper
https://portal.mardi4nfdi.de/entity/Q49498502000-05-07Paper
Edge-augmentation of hypergraphs2000-02-27Paper
Wheel inequalities for stable set polytopes1997-11-25Paper
A faster algorithm for computing the strength of a network1994-04-05Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Eddie Cheng