# Xiaofeng Guo

According to our database

Collaborative distances:

^{1}, Xiaofeng Guo authored at least 78 papers between 1986 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Solving viscoelastic problems with cyclic symmetry via a temporally adaptive EFG-SB partitioning algorithm.

Eng. Comput. (Lond.), 2019

A new kind of parameter for fault tolerance of graphs.

Concurrency and Computation: Practice and Experience, 2019

2018

DSCL Hand: A Novel Underactuated Robot Hand of Linearly Parallel Pinch and Self-adaptive Grasp with Double-Slider Co-circular Linkage Mechanisms.

Proceedings of the Intelligent Robotics and Applications - 11th International Conference, 2018

2016

On total domination number of Cartesian product of directed cycles.

Ars Comb., 2016

Local restricted edge connectivity and restricted edge connectivity of graphs.

Ars Comb., 2016

2015

The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs.

Graphs and Combinatorics, 2015

Extending matchings in planar odd graphs.

Ars Comb., 2015

On cyclic edge connectivity of regular graphs with two orbits.

Ars Comb., 2015

Super connectivity of Kronecker products of some graphs.

Ars Comb., 2015

Super 3-restricted edge connectivity of triangle-free graphs.

Ars Comb., 2015

A new fast nonlinear principal component analysis algorithm for blind source separation.

Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015

2014

Fault tolerance of hypercubes and folded hypercubes.

The Journal of Supercomputing, 2014

Collapsible Graphs and Hamiltonicity of Line Graphs.

Graphs and Combinatorics, 2014

Total chromatic number of generalized Mycielski graphs.

Discrete Mathematics, 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.

Discrete Applied Mathematics, 2014

On cycle resonant outerplanar graphs.

Ars Comb., 2014

Restricted arc-connectivity of digraphs.

Ars Comb., 2014

2013

Meeting the "Digital Natives": Understanding the Acceptance of Technology in Classrooms.

Educational Technology & Society, 2013

Total chromatic number of folded hypercubes.

Ars Comb., 2013

Super connectivity and super arc connectivity of the Mycielskian of a digraph.

Ars Comb., 2013

Super-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs.

Appl. Math. Lett., 2013

2012

Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph.

Graphs and Combinatorics, 2012

Collapsible graphs and Hamiltonian connectedness of line graphs.

Discrete Applied Mathematics, 2012

Hosoya polynomials of the capped zig-zag nanotubes.

Ars Comb., 2012

Hamiltonicity of 3-connected line graphs.

Appl. Math. Lett., 2012

Super λ

_{3}-optimality of regular graphs.
Appl. Math. Lett., 2012

Some upper bounds for the atom-bond connectivity index of graphs.

Appl. Math. Lett., 2012

The construction of concept system in TCM syndrome ontology.

Proceedings of the 2012 IEEE International Conference on Automation and Logistics, 2012

SO-RTI: A new RTI based on web services.

Proceedings of the 2012 IEEE International Conference on Automation and Logistics, 2012

2011

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

Inf. Sci., 2011

On super 2-restricted and 3-restricted edge-connected vertex transitive graphs.

Discrete Mathematics, 2011

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

Discrete Mathematics, 2011

Strong Distances in Strong Oriented Complete k-Partite Graphs.

Ars Comb., 2011

The optimal strong radius and optimal strong diameter of the Cartesian product graphs.

Appl. Math. Lett., 2011

On a kind of reliability analysis of networks.

Applied Mathematics and Computation, 2011

2010

Removable ears of 1-extendable graphs.

J. Systems Science & Complexity, 2010

A kind of conditional fault tolerance of (n, k)-star graphs.

Inf. Process. Lett., 2010

Super connectivity of Kronecker products of graphs.

Inf. Process. Lett., 2010

A lower bound on the number of removable ears of 1-extendable graphs.

Discrete Mathematics, 2010

Federated Content Rights Management for Research and Academic Publications Using the Handle System.

D-Lib Magazine, 2010

Contractible edges of k-connected graphs for k = 4, 5.

Ars Comb., 2010

On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition.

Ars Comb., 2010

Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs.

Ars Comb., 2010

2009

Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes.

Inf. Process. Lett., 2009

Removable edges in a k-connected graph and a construction method for k-connected graphs.

Discrete Mathematics, 2009

Optimal strong (kappa, d)-orientation of complete k-partite graphs.

Discrete Applied Mathematics, 2009

A novel characterization of n-extendable bipartite graphs.

Ars Comb., 2009

Connectivity of the Mycielskian of a digraph.

Appl. Math. Lett., 2009

Lower and upper orientable strong diameters of graphs satisfying the Ore condition.

Appl. Math. Lett., 2009

2008

Super-connected and hyper-connected jump graphs.

Int. J. Comput. Math., 2008

Removable edges in a 5-connected graph and a construction method of 5-connected graphs.

Discrete Mathematics, 2008

2007

Research on Ant Colony Neural Network PID Controller and Application.

Proceedings of the 8th ACIS International Conference on Software Engineering, 2007

Latency hiding through multithreading on a network processor.

Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

Latency Hiding in Multi-Threading and Multi-Processing of Network Applications.

Proceedings of the 16th International Conference on Parallel Architectures and Compilation Techniques (PACT 2007), 2007

2006

Lower and upper orientable strong radius and strong diameter of complete k-partite graphs.

Discrete Applied Mathematics, 2006

2004

Reducible chains of planar 1-cycle resonant graphs.

Discrete Mathematics, 2004

An Adaptive Routing Strategy Based on Dynamic Cache in Mobile Ad Hoc Networks.

Proceedings of the Parallel and Distributed Processing and Applications, 2004

2003

Planar k-cycle resonant graphs with k=1, 2.

Discrete Applied Mathematics, 2003

2002

Some Notes on 2-D Graphical Representation of DNA Sequence.

Journal of Chemical Information and Computer Sciences, 2002

Boundary uniqueness of fusenes.

Discrete Applied Mathematics, 2002

2001

On the Characterization of DNA Primary Sequences by Triplet of Nucleic Acid Bases.

Journal of Chemical Information and Computer Sciences, 2001

k-Resonant Benzenoid Systems and k-Cycle Resonant Graphs.

Journal of Chemical Information and Computer Sciences, 2001

Pathway Analysis of Bacillus subtillis Metabolic Network Based on Genomic Information.

Proceedings of the Computer science and biology: Proceedings of the German Conference on Bioinformatics, 2001

1998

Use of path matrices for a characterization of molecular structures.

Proceedings of the Discrete Mathematical Chemistry, 1998

An efficient algorithm for determining fixed bonds and normal components in a bipartite graph.

Proceedings of the Discrete Mathematical Chemistry, 1998

1996

Concealed Non-Kekuléan Benzenoids [J. Chem. Inf. Comput. Sci 35, 226-232 (1995)].

Journal of Chemical Information and Computer Sciences, 1996

1995

Concealed Non-Kekul.acte.ean Benzenoids.

Journal of Chemical Information and Computer Sciences, 1995

1994

Wiener Matrix Invariants.

Journal of Chemical Information and Computer Sciences, 1994

Recursive Method for Enumeration of Linearly Independent and Minimal Conjugated Circuits of Benzenoid Hydrocarbons.

Journal of Chemical Information and Computer Sciences, 1994

k-Cycle resonant graphs.

Discrete Mathematics, 1994

1993

Wiener matrix: Source of novel graph invariants.

Journal of Chemical Information and Computer Sciences, 1993

Theory of polypentagons.

Journal of Chemical Information and Computer Sciences, 1993

1992

Enumeration and classification of benzenoid systems. 32. Normal perifusenes with two internal vertices.

Journal of Chemical Information and Computer Sciences, 1992

Reducible chains in several types of 2-connected graphs.

Discrete Mathematics, 1992

1991

Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs.

Discrete Applied Mathematics, 1991

1988

Z-transformation graphs of perfect matchings of hexagonal systems.

Discrete Mathematics, 1988

1987

Hamilton cycles in directed Euler tour graphs.

Discrete Mathematics, 1987

1986

Hamilton cycles in Euler tour graph.

J. Comb. Theory, Ser. B, 1986