Results 181 to 189 of about 38,382 (189)

Tetravalent half‐edge‐transitive graphs and non‐normal Cayley graphs

Journal of Graph Theory, 2011
AbstractLet X be a vertex‐transitive graph, that is, the automorphism group Aut(X) of X is transitive on the vertex set of X. The graph X is said to be symmetric if Aut(X) is transitive on the arc set of X. suppose that Aut(X) has two orbits of the same length on the arc set of X.
Wang, Xiuyun, Feng, Yan-Quan
openaire   +2 more sources

Perfect matchings in edge-transitive graphs

2014
Summary: We find recursive formulae for the number of perfect matchings in a graph \(G\) by splitting \(G\) into subgraphs \(H\) and \(Q\). We use these formulas to count perfect matching of \(P\) hypercube \(Q_n\). We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is \(Pm(G)=(2q/p)Pm(G\backslash \{u,v\}
Marandi, A., Nejah, A., Behmaram, A.
openaire   +2 more sources

Cubic edge-transitive graphs of order $$2^np$$

Journal of Algebraic Combinatorics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue Wang, Jin-Xin Zhou
openaire   +1 more source

Biprimitive edge-transitive pentavalent graphs

Discrete Mathematics
Let \(\Gamma=(V,E)\) be a connected bipartite graph with bipartition \(( U , W )\), that is, \(V\) is partitioned into two independent sets \(U\) and \(W\). We call each of \(U\) and \(W\) a part of the graph \(\Gamma\). Denote by \(\Aut^+( \Gamma )\) the bipartition preserving the automorphism group of \(\Gamma\), that is, \(\Aut^ + ( \Gamma ) = \{ g \
Qi Cai, Zai Ping Lu
openaire   +2 more sources

Random walks on edge transitive graphs

Statistics & Probability Letters, 1998
The authors find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending some results obtained by van Slijpe (1986), Aldous (1989), Devroye and Sbihi (1990) and Palacios (1992).
Palacios, José Luis, Renom, José Miguel   +1 more
openaire   +2 more sources

On Reconstruction of Normal Edge-Transitive Cayley Graphs

Annals of Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khosravi, Behnam, Khosravi, Behrooz, Khosravi, Bahman   +2 more
openaire   +2 more sources

EDGE-TRANSITIVE GRAPH AUTOMORPHISMS AND PERIODIC SURFACE HOMEOMORPHISMS

International Journal of Bifurcation and Chaos, 1999
An automorphism of a graph is edge-transitive if it acts transitively on the set of geometric edges (components of the complement of the vertices), or equivalently, if there is no nontrivial invariant subgraph. Every such automorphism can be embedded as the restriction to an invariant spine of some orientation-preserving periodic homeomorphism of a ...
Los, Jérôme E., Nitecki, Zbigniew H.
openaire   +2 more sources

Tetravalent edge-transitive graphs of order p 2 q

Science China Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pan, Jiangmin, Liu, Yin, Huang, Zhaohong, Liu, Chenlong   +3 more
openaire   +2 more sources

Locally finite, planar, edge-transitive graphs

Memoirs of the American Mathematical Society, 1997
Jack E. Graver, Mark E. Watkins
openaire   +1 more source