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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Network epidemics is a ubiquitous model that can represent different phenomena and finds applications in various domains. Among…

2017

The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices…

2016

Abstract In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic…

2015

We study the class of edge-transitive graphs of square-free order and valency at most $k$. It is shown that, except for a few…

2015

This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists…

2014

2014

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these…

2013

A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is…

2009

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be a…

2000

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More…