Super cyclically edge-connected vertex-transitive graphs of girth at least 5
From MaRDI portal
Publication:2392003
DOI10.1007/S10114-013-2255-4zbMATH Open1269.05057OpenAlexW2049183831MaRDI QIDQ2392003FDOQ2392003
Publication date: 6 August 2013
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-013-2255-4
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional connectivity
- Endliche Gruppen I
- On weakly symmetric graphs of order twice a prime
- On computing a conditional edge-connectivity of a graph
- On a Class of Fixed-Point-Free Graphs
- Automorphism groups and isomorphisms of Cayley digraphs
- Vertex-transitive graphs
- Sufficient conditions for a graph to be super restricted edge-connected
- Vertex-transitive graphs that are not Cayley graphs. II
- On conditional edge-connectivity of graphs
- Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
- On vertex-transitive graphs of odd prime-power order
- Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.
- Cubic vertex-transitive graphs of order 2pq
- Tetravalent vertex‐transitive graphs of order 4p
- Super restricted edge connectivity of regular edge-transitive graphs
- On super restricted edge-connectivity of edge-transitive graphs
- Generalizing the generalized Petersen graphs
- On cyclic edge-connectivity of transitive graphs
- On the 2-extendability of planar graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- Super cyclically edge connected transitive graphs
- Cyclic edge-cuts in fullerene graphs
- Infinitely many hypohamiltonian cubic graphs of girth 7
- 3-restricted edge cut of graphs
Cited In (2)
This page was built for publication: Super cyclically edge-connected vertex-transitive graphs of girth at least 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392003)
