ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Research
Literature
Library and Museology
Languages
Computing
Biology
Architecture and Urbanism
all records (73)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Denmark
Australia
Ukraine
Italy
Canada
South Africa
Chile
all records (74)

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

Filter  
 
4.255  Articles
1 of 427 pages  |  10  records  |  more records»
A regular cover of a connected graph is called dihedral ifits transformation group is dihedral. In this paper, the authors clas-sify all dihedral coverings of the Heawood graph whose fibre-preservingautomorphism subgroups act edge-transitively.

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 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

The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is uniform. It is ... 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

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)?V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v). In ... 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 this paper we introduce and study a type of Cayley graph – subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph Kpd,pd\mathbf{K}_{p^d,p^d} with pp ... see more

1 of 427 pages  |  10  records  |  more records»