AbstractThe least (and greatest) number of edges realizable by a graph having n vertices and automorphism group isomorphic to D2m, the dihedral group of order 2m, is determined for all admissible n
For a simple graph G on n vertices, a real symmetric nxn matrix A is said to be compatible with G, i...
This thesis discusses the use of the characteristic polynomial and minimal polynomial of the adjacen...
AbstractThe fixing number of a graph G is the minimum cardinality of a set S⊂V(G) such that every no...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractWe give upper bounds on the order of the automorphism group of a simple graph
A graph X is said to represent the group G with k edge (vertex) orbits if the automorphism group of ...
AbstractFor k > 1, let Hk denote the hyperoctahedral group Sk[S2] of order 2kk!. An (Hk, n)- graph i...
Let mij(G) be the number of edges of graph G, connecting vertices of degrees i and j. Necessary and ...
AbstractWe determine the minimum number of vertices an edge-colored graph must have, if its group of...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
We survey vertex minimal graphs with prescribed automorphism group. Whenever possible, we also inves...
AbstractLet f(n) (f2(n)) be the maximum possible number of edges in a graph (2-connected simple grap...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
For a simple graph G on n vertices, a real symmetric nxn matrix A is said to be compatible with G, i...
This thesis discusses the use of the characteristic polynomial and minimal polynomial of the adjacen...
AbstractThe fixing number of a graph G is the minimum cardinality of a set S⊂V(G) such that every no...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractWe give upper bounds on the order of the automorphism group of a simple graph
A graph X is said to represent the group G with k edge (vertex) orbits if the automorphism group of ...
AbstractFor k > 1, let Hk denote the hyperoctahedral group Sk[S2] of order 2kk!. An (Hk, n)- graph i...
Let mij(G) be the number of edges of graph G, connecting vertices of degrees i and j. Necessary and ...
AbstractWe determine the minimum number of vertices an edge-colored graph must have, if its group of...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
We survey vertex minimal graphs with prescribed automorphism group. Whenever possible, we also inves...
AbstractLet f(n) (f2(n)) be the maximum possible number of edges in a graph (2-connected simple grap...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
For a simple graph G on n vertices, a real symmetric nxn matrix A is said to be compatible with G, i...
This thesis discusses the use of the characteristic polynomial and minimal polynomial of the adjacen...
AbstractThe fixing number of a graph G is the minimum cardinality of a set S⊂V(G) such that every no...
DOI
Add to ORKG