Skip to search formSkip to main contentSkip to account menu

Vertex-transitive graph

Known as: Vertex transitive graph 
In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
One of the fascinating results in the one dimensional nonlinear dynamical system is that a mapping which maps a compact connected… 
2010
2010
This paper outlines a strategy to build new bilingual dictionaries from existing resources. The method is based on two main tasks… 
2006
2006
1. List of contributors 2. Introduction (by Unsworth, Sharon) 3. The acquisition of voice and transitivity alternations in Greek… 
2004
2004
We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V, E) is called vertex transitive if… 
2000
2000
A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair… 
1996
1996
studied for more than a now, vertex-transitive graphs have quite great deal of activity. Their rich groups of automorphisms make… 
1994
1994
We present a new construction of infinite families of (finite as well as infinite) vertex-transitive graphs that are not Cayley… 
1990
1990
The relationship between scaling practice and scaling theory remains a controversial problem in Information Retrieval research… 
1986
1986
A reachability matrix M is a binary matrix with the reflexive and transitive property, i.e., M + I = M, and M2 = M, where I is…