Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Huang and Wu in [IEEE Transactions on Computers 46 (1997) 484-490] introduced the balanced hypercube BH<sub>n</sub> as an… Expand

Is this relevant?

2015

2015

We present some new discoveries about graphs that are half-arc-transitive (that is, vertex- and edge-transitive but not arc… Expand

Is this relevant?

2015

2015

Abstract A regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive. In this paper, we give a… Expand

Is this relevant?

2012

2012

Abstract A classification is given for connected edge-transitive tetravalent Cayley graphs of square-free order. The… Expand

Is this relevant?

2010

2010

The symmetry properties of mathematical structures are often important for understanding these structures. Graphs sometimes have… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (, find the… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

The chemical potential for a novel intrinsic graph metric, the resistance distance, is briefly recalled, and then a number of… Expand

Is this relevant?

2001

2001

In this paper, infinitely many graphs of large valency which are half-transitive (that is vertex- and edge-transitive but not arc… Expand

Is this relevant?

1998

1998

Abstract A vertex-transitive graph is said to be 1 2 -transitive if its automorphism group is vertex- and edge- but not arc… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Abstract A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive. In 1971, Chao… Expand

Is this relevant?