Add to ORKGThe automorphism group of a graph acts on its cocycle space over any field. The orbits of this group action will be counted in case of finite fields. In particular, we obtain an enumeration of non-equivalent edge cuts of the graph
We consider the action of a group G on a graph E = (E0,E1, r, s). This induces a representation ρ of...
For a non-abelian group G, the non-commuting graph Γ(G) has G−Z(G) as its vertex set and two vertice...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractThe five problems of counting component colorings, vertex colorings, arc colorings, cocycles...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
A graph X is said to represent the group G with k edge (vertex) orbits if the automorphism group of ...
AbstractWe address several specific aspects of the following general question: can a field K have so...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
The power graph of a group is the graph whose vertex set is the group, two elements being adjacent i...
AbstractNon-separable graphs are enumerated, and also graphs without end-points. The basic enumerati...
AbstractThe power graph of a group is the graph whose vertex set is the group, two elements being ad...
AbstractFinite groups may be classified as to whether or not they have regular representations as au...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
AbstractGiven two integers ν > 0 and ϵ >/ 0, we prove that there exists a finite graph (resp. a fini...
We consider the action of a group G on a graph E = (E0,E1, r, s). This induces a representation ρ of...
For a non-abelian group G, the non-commuting graph Γ(G) has G−Z(G) as its vertex set and two vertice...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
AbstractThe five problems of counting component colorings, vertex colorings, arc colorings, cocycles...
AbstractIf a class C of finite graphs is closed under contraction and forming subgraphs, and if ever...
A graph X is said to represent the group G with k edge (vertex) orbits if the automorphism group of ...
AbstractWe address several specific aspects of the following general question: can a field K have so...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
The power graph of a group is the graph whose vertex set is the group, two elements being adjacent i...
AbstractNon-separable graphs are enumerated, and also graphs without end-points. The basic enumerati...
AbstractThe power graph of a group is the graph whose vertex set is the group, two elements being ad...
AbstractFinite groups may be classified as to whether or not they have regular representations as au...
This paper concerns aspects of various graphs whose vertex set is a group G and whose edges reflect ...
AbstractGiven two integers ν > 0 and ϵ >/ 0, we prove that there exists a finite graph (resp. a fini...
We consider the action of a group G on a graph E = (E0,E1, r, s). This induces a representation ρ of...
For a non-abelian group G, the non-commuting graph Γ(G) has G−Z(G) as its vertex set and two vertice...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...