Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,229,789 papers from all fields of science
Search
Sign In
Create Free Account
Edge-transitive graph
In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Broader (1)
Algebraic graph theory
Biregular graph
Graph (discrete mathematics)
Graph automorphism
Graph coloring
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On a Generalization of the Bipartite Graph $D(k,q)$
Xiao-Yan Cheng
,
Yuan-Sheng Tang
,
Huaxiong Wang
2017
Corpus ID: 119300572
In this paper, we deal with a generalization $\Gamma(\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and…
Expand
2017
2017
On Alternatively Connected Edge-Transitive Graphs of Square-free Order
Guang Li
,
Zai-Ping Lu
Graphs and Combinatorics
2017
Corpus ID: 253889838
An edge-transitive graph Γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts…
Expand
2015
2015
The 4-Regular Edge-Transitive Graphs of Girth 4
Tomas Boothby
,
Matt DeVos
2015
Corpus ID: 119724056
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists…
Expand
2014
2014
Parallel graph coloring algorithms on the GPU using OpenCL
Sailik Sengupta
International Conference on Computing for…
2014
Corpus ID: 18600531
GPUs (Graphics Processing Units) are designed to solve large data-parallel problems encountered in the fields of image processing…
Expand
2012
2012
GI-graphs and their groups
M. Conder
,
Tomaž Pisanski
,
Arjana Žitnik
2012
Corpus ID: 118639191
The class of generalized Petersen graphs was introduced by Coxeter in the 1950s. Frucht, Graver and Watkins determined the…
Expand
2011
2011
On Semisymmetric Cubic Graphs of Order 10p3
M. Alaeiyan
,
B. N. Onagh
2011
Corpus ID: 125322905
Connected cubic graphs of order 10p which admit an automorphism group acting semisymmetrically are investigated. We prove that…
Expand
2007
2007
GRAPHS OF SMALLEST ORDERShao -
Fei Du
,
Dragan Maru
2007
Corpus ID: 16925456
A regular and edge-transitive graph which is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is…
Expand
2000
2000
Edge-Transitive Graph
E. Weisstein
2000
Corpus ID: 155988133
An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More…
Expand