Add to ORKGIn this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there are 1/2D1/2 vertex-disjoint paths from every vertex to every other vertex in a Cayley color graph associated with a finite group G and a non redundant generating set D for G. We also extend this result to a certain class of Cayley graphs
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
AbstractIn an edge-colored graph, we say that a path is alternating if it has at least three vertice...
Abstract. For the purpose of large scale computing,we are inter-ested in linking computers into larg...
Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, ...
Let G be a graph. Then T subset of V(G) is called an R(k)-vertex-cut if G - T is disconnected and ea...
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmet...
AbstractIn this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
Motivated by an open problem of Abawajy et al. [1] we find some relations between power graphs and C...
In the master thesis we are dealing with a very well known family of graphs with a lot of symmetry,...
AbstractMotivated by an open problem of Abawajy et al. [1] we find some relations between power grap...
Abstract. The question of which groups admit planar Cayley graphs goes back over 100 years, having b...
AbstractLet Γ(G, T) denote the Cayley graph of a finite group G with respect to a normal subset T of...
We consider several families of Cayley graphs on the finite Coxeter groups A<sub>n</sub>, B<sub>n</s...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
AbstractIn an edge-colored graph, we say that a path is alternating if it has at least three vertice...
Abstract. For the purpose of large scale computing,we are inter-ested in linking computers into larg...
Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, ...
Let G be a graph. Then T subset of V(G) is called an R(k)-vertex-cut if G - T is disconnected and ea...
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmet...
AbstractIn this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
Motivated by an open problem of Abawajy et al. [1] we find some relations between power graphs and C...
In the master thesis we are dealing with a very well known family of graphs with a lot of symmetry,...
AbstractMotivated by an open problem of Abawajy et al. [1] we find some relations between power grap...
Abstract. The question of which groups admit planar Cayley graphs goes back over 100 years, having b...
AbstractLet Γ(G, T) denote the Cayley graph of a finite group G with respect to a normal subset T of...
We consider several families of Cayley graphs on the finite Coxeter groups A<sub>n</sub>, B<sub>n</s...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s1, t1),..., (sk, ...
AbstractIn an edge-colored graph, we say that a path is alternating if it has at least three vertice...