نتایج جستجو برای: normal graph
تعداد نتایج: 749861 فیلتر نتایج به سال:
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...
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...
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...
it seems that the general applicability of the quantum theory of atoms in molecules (qtaim) oncharacterizing the bonded interactions is still questionable even afier 30 years since its formulation. fordemonstrating the generality of bonding schemes in qta im, ea( isomers were chosen as the modelsystems and the results from molecular charge density analysis and vibrational normal modes werecompa...
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 is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
A graph G is called normal if there exist two coverings, C and S of its vertex set such that every member induces a clique in G, an independent C∩S≠∅ for C∈C S∈S. It has been conjectured by De Simone Körner 1999 does not contain C5, C7 C7‾ as induced subgraph. We disprove this conjecture.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید