Eddie Cheng

Philip Hu

Roger Jia

Networks, 2012

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

[BibT_eX]

[DOI]

Networks, 2012

A Unified Approach to the Conditional Diagnosability of Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2012

On deriving conditional diagnosability of interconnection networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Component connectivity of the hypercubes.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2012

Solution to an open problem on 4-ordered Hamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

One-to-many node-disjoint paths of hyper-star networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Matching preclusion and conditional matching preclusion for regular interconnection networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Optimal Independent Spanning Trees on Odd Graphs.

[BibT_eX]

[DOI]

J. Supercomput., 2011

Conditional matching preclusion for the arrangement graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the Surface Areas and Average Distances of Meshes and Tori.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2011

Strong Matching preclusion for the Alternating Group Graphs and Split-Stars.

[BibT_eX]

[DOI]

Philip Bonneville

Joseph Renzi

J. Interconnect. Networks, 2011

Independent spanning trees on even networks.

[BibT_eX]

[DOI]

Inf. Sci., 2011

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Linearly Many Faults in (n, k)-Star Graphs.

[BibT_eX]

[DOI]

Allen Yuan

Int. J. Found. Comput. Sci., 2011

A note on embeddings among folded hypercubes, even graphs and odd graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2011

Conditional matching preclusion for the alternating group graphs and split-stars.

[BibT_eX]

[DOI]

Matthew Toeniskoetter

Int. J. Comput. Math., 2011

On the edge-connectivity of graphs with two orbits of the same size.

[BibT_eX]

[DOI]

Discret. Math., 2011

Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database.

[BibT_eX]

[DOI]

Christopher E. Gillies

Proceedings of the World Congress on Services, 2011

On the Surface Area of the Asymmetric Twisted Cube.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Linearly many faults in 2-tree-generated networks.

[BibT_eX]

[DOI]

Fred Sala

Networks, 2010

4-Ordered Hamiltonicity for Some Chordal Ring Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2010

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2010

Matching preclusion and Conditional Matching preclusion for Augmented Cubes.

[BibT_eX]

[DOI]

Randy Jia

David Lu

J. Interconnect. Networks, 2010

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

[BibT_eX]

[DOI]

Inf. Sci., 2010

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

Matching preclusion for the (n, k)-bubble-sort graphs.

[BibT_eX]

[DOI]

David Sherman

Int. J. Comput. Math., 2010

The Number of Shortest Paths in the (n, k)-Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

On the surface area of the (n, k)-star graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A short note on the surface area of star graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

A Generating Function Approach to the Surface Areas of Some Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

Conditional matching preclusion sets.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Embedding hypercubes, rings, and odd graphs into hyper-stars.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

On Disjoint Shortest Paths Routing on the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Hamiltonian connectivity of 2-tree-generated networks.

[BibT_eX]

[DOI]

Math. Comput. Model., 2008

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2008

Matching preclusion for Alternating Group Graphs and their Generalizations.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Strong structural properties of unidirectional star graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Orienting Cayley graphs generated by transposition trees.

[BibT_eX]

[DOI]

Nart Shawash

Comput. Math. Appl., 2008

2007

Matching preclusion for some interconnection networks.

[BibT_eX]

[DOI]

Networks, 2007

Linearly many faults in Cayley graphs generated by transposition trees.

[BibT_eX]

[DOI]

Inf. Sci., 2007

Fault Resiliency of Cayley Graphs Generated by Transpositions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

2006

Structural Properties Of Hyper-Stars.

[BibT_eX]

Ars Comb., 2006

2005

Maximal vertex-connectivity of.

[BibT_eX]

[DOI]

William A. Lindsey

Daniel E. Steffy

Networks, 2005

2004

Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

2003

Time-stamped Graphs and Their Associated Influence Digraphs.

[BibT_eX]

[DOI]

Jerrold W. Grossman

Discret. Appl. Math., 2003

2002

On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

Increasing the connectivity of the star graphs.

[BibT_eX]

[DOI]

Networks, 2002

Antiweb-wheel inequalities and their separation problems over the stable set polytopes.

[BibT_eX]

[DOI]

Math. Program., 2002

Unidirectional (n, k)-Star Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2002

Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

Basic Structures of Some Interconnection Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Jerrold W. Grossman

Electron. Notes Discret. Math., 2002

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Flow Formulations for the Student Scheduling Problem.

[BibT_eX]

[DOI]

Serge G. Kruk

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2001

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

[BibT_eX]

Hyungju Park

Ars Comb., 2001

2000

Orienting split-stars and alternating group graphs.

[BibT_eX]

[DOI]

Networks, 2000

On the Day-Tripathi orientation of the star graphs: Connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1999

Successive edge-connectivity augmentation problems.

[BibT_eX]

[DOI]

Tibor Jordán

Math. Program., 1999

Edge-augmentation of hypergraphs.

[BibT_eX]

[DOI]

Math. Program., 1999

1998

Separating subdivision of bicycle wheel inequalities over cut polytopes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1998

1997

Wheel inequalitites for stable set polytopes.

[BibT_eX]

[DOI]

William H. Cunningham

Math. Program., 1997

1995

Separation Problems for the Stable Set Polytope.

[BibT_eX]

[DOI]

William H. Cunningham

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

A Faster Algorithm for Computing the Strength of a Network.

[BibT_eX]

[DOI]