ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Languages
Literature
Computing
Education
Pure sciences
Social Sciences
Economy
all records (55)

Languages
English
Portuguese
German

Countries
Indonesia
Australia
USA
Chile
Ukraine
Italy
Brazil
Slovenia
Denmark
South Africa
all records (46)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
858  Articles
1 of 87 pages  |  10  records  |  more records»
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interes... see more

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interes... see more

We characterise connected cubic graphs admitting a vertex-transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of ... see more

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ? V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-... see more

We study groups acting vertex-transitively and non-discretely on connected, cubic graphs (regular graphs of degree 3). Using ideas from Tutte's fundamental papers in 1947 and 1959, it is shown that if the action is edge-transitive, then the graph has to b... see more

We study groups acting vertex-transitively and non-discretely on connected, cubic graphs (regular graphs of degree 3). Using ideas from Tutte's fundamental papers in 1947 and 1959, it is shown that if the action is edge-transitive, then the graph has to b... see more

In some recent papers the method of partial differences introduced by the author in [4] was very helpful in the construction of cyclic cycle systems. Here we use and describe in all details this method for the purpose of constructing, more generally, cycl... see more

We show that real tight frames that generate lattices must be rational. In the case of irreducible group frames, we show that the corresponding lattice is always strongly eutactic. We use this observation to describe a construction of strongly eutactic la... see more

We develop a new framework for analysing finite connected, oriented graphs of valency four, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of `basic' graphs such that ea... see more

1 of 87 pages  |  10  records  |  more records»