Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn $k$-connected-homogeneous graphs
102
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A graph $Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $Gamma$, and connected-homogeneous (CH) if this property holds for all $k$. Locally finite, locally connected graphs often fail to be 4-CH because of a combinatorial obstruction called the unique $x$ property; we prove that this property holds for locally strongly regular graphs under various purely combinatorial assumptions. We then classify the locally finite, locally connected 4-CH graphs. We also classify the locally finite, locally disconnected 4-CH graphs containing 3-cycles and induced 4-cycles, and prove that, with the possible exception of locally disconnected graphs containing 3-cycles but no induced 4-cycles, every finite 7-CH graph is CH.
rate research
Read More
A finite graph $G$ is said to be {em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $gin G$ of the graph, where $G$ is a group of automorphisms of the graph. In 1985, Cameron and Macpherson determined all finite $(G, 3)$-homogeneous graphs. In this paper, we develop a method for characterising $(G,3)$-connected homogeneous graphs. It is shown that for a finite $(G,3)$-connected homogeneous graph $G=(V, E)$, either $G_v^{G(v)}$ is $2$--transitive or $G_v^{G(v)}$ is of rank $3$ and $G$ has girth $3$, and that the class of finite $(G,3)$-connected homogeneous graphs is closed under taking normal quotients. This leads us to study graphs where $G$ is quasiprimitive on $V$. We determine the possible quasiprimitive types for $G$ in this case and give new constructions of examples for some possible types.
We investigate groups whose Cayley graphs have poor-ly connected subgraphs. We prove that a finitely generated group has bounded separation in the sense of Benjamini--Schramm--Timar if and only if it is virtually free. We then prove a gap theorem for connectivity of finitely presented groups, and prove that there is no comparable theorem for all finitely generated groups. Finally, we formulate a connectivity version of the conjecture that every group of type $F$ with no Baumslag-Solitar subgroup is hyperbolic, and prove it for groups with at most quadratic Dehn function.
For a graph G=(V,E), the k-dominating graph of G, denoted by $D_{k}(G)$, has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of $D_{k}(G)$ are adjacent if and only if the dominating set corresponding to one of the vertices can be obtained from the dominating set corresponding to the second vertex by the addition or deletion of a single vertex. We denote by $d_{0}(G)$ the smallest integer for which $D_{k}(G)$ is connected for all k greater than or equal to $d_{0}(G)$. It is known that $d_{0}(G)$ lies between $Gamma(G)+1$ and $|V|$ (inclusive), where ${Gamma}(G)$ is the upper domination number of G, but constructing a graph G such that $d_{0}(G)>{Gamma}(G)+1$ appears to be difficult. We present two related constructions. The first construction shows that for each integer k greater than or equal to 3 and each integer r from 1 to k-1, there exists a graph $G_{k,r}$ such that ${Gamma}(G_{k,r})=k, {gamma}(G_{k,r})=r+1$ and $d_{0}(G_{k,r})=k+r={Gamma}(G)+{gamma}(G)-1$. The second construction shows that for each integer k greater than or equal to 3 and each integer r from 1 to k-1, there exists a graph $Q_{k,r}$ such that ${Gamma}(Q_{k,r})=k, {gamma}(Q_{k,r})=r$ and $d_{0}(Q_{k,r})=k+r={Gamma}(G)+{gamma}(G)$.
Let $G$ be a permutation group on a set $Omega$ and recall that a base for $G$ is a subset of $Omega$ such that its pointwise stabiliser is trivial. In a recent paper, Burness and Giudici introduced the Saxl graph of $G$, denoted $Sigma(G)$, with vertex set $Omega$ and two vertices adjacent if they form a base. If $G$ is transitive, then $Sigma(G)$ is vertex-transitive and it is natural to consider its valency (which we refer to as the valency of $G$). In this paper we present a general method for computing the valency of any finite transitive group and we use it to calculate the exact valency of every primitive group with stabiliser a Frobenius group with cyclic kernel. As an application, we calculate the valency of every almost simple primitive group with an alternating socle and soluble stabiliser and we use this to extend results of Burness and Giudici on almost simple primitive groups with prime-power or odd valency.
Let $G$ be a group and $Ssubseteq G$ its subset such that $S=S^{-1}$, where $S^{-1}={s^{-1}mid sin S}$. Then {it the Cayley graph ${rm Cay}(G,S)$} is an undirected graph $Gamma$ with the vertex set $V(Gamma)=G$ and the edge set $E(Gamma)={(g,gs)mid gin G, sin S}$. A graph $Gamma$ is said to be {it integral} if every eigenvalue of the adjacency matrix of $Gamma$ is integer. In the paper, we prove the following theorem: {it if a subset $S=S^{-1}$ of $G$ is normal and $sin SRightarrow s^kin S$ for every $kin mathbb{Z}$ such that $(k,|s|)=1$, then ${rm Cay}(G,S)$ is integral.} In particular, {it if $Ssubseteq G$ is a normal set of involutions, then ${rm Cay}(G,S)$ is integral.} We also use the theorem to prove that {it if $G=A_n$ and $S={(12i)^{pm1}mid i=3,dots,n}$, then ${rm Cay}(G,S)$ is integral.} Thus, we give positive solutions for both problems 19.50(a) and 19.50(b) in Kourovka Notebook.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
