On the number of closed walks in vertex-transitive graphs
From MaRDI portal
Publication:864137
DOI10.1016/J.DISC.2005.09.039zbMath1111.05046OpenAlexW2011663612MaRDI QIDQ864137
Dragan Marušič, Aleksander Malnič, Jajcay, Robert
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.039
Related Items (2)
Bounds on the number of closed walks in a graph and its applications ⋮ Cayley properties of merged Johnson graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
- Vertex-primitive graphs of order a product of two distinct primes
- Classifying vertex-transitive graphs whose order is a product of two primes
- A note on the generalized Petersen graphs that are also Cayley graphs
- On solvable groups and circulant graphs
- The existence of selfcomplementary circulant graphs
- Vertex-transitive graphs
- Vertex-transitive graphs: Symmetric graphs of prime valency
- My Graph
- Which generalized petersen graphs are cayley graphs?
This page was built for publication: On the number of closed walks in vertex-transitive graphs
