نتایج جستجو برای: edge-transitive
تعداد نتایج: 119893 فیلتر نتایج به سال:
darafsheh and assari in [normal edge-transitive cayley graphs on non-abelian groups of order 4p, where $p$ is a prime number, sci. china math., 56 (1) (2013) 213-219.] classified the connected normal edge transitive and $frac{1}{2}-$arc-transitive cayley graph of groups of order $4p$. in this paper we continue this work by classifying the connected cayley graph of groups of order...
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
darafsheh and assari in [normal edge-transitive cayley graphs onnon-abelian groups of order 4p, where p is a prime number, sci. china math. {bf 56} (1) (2013) 213$-$219.] classified the connected normal edge transitive and $frac{1}{2}-$arc-transitive cayley graph of groups of order$4p$. in this paper we continue this work by classifying theconnected cayley graph of groups of order $2pq$, $p > q...
for two normal edge-transitive cayley graphs on groups h and k which have no common direct factor and gcd(jh=h ′j; jz(k)j) = 1 = gcd(jk=k ′j; jz(h)j), we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
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 qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...
let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge set $e(g)$. the (first) edge-hyper wiener index of the graph $g$ is defined as: $$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$ where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...
a graph $gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $gamma$ acts transitively on $v(gamma)$ or $e(gamma)$, respectively. let $gamma=cay(g,s)$ be a cayley graph on $g$ relative to $s$. then, $gamma$ is said to be normal edge-transitive, if $n_{aut(gamma)}(g)$ acts transitively on edges. in this paper, the eigenvalues of normal edge-tra...
In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید