Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,987,129 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Broader (1)
Algebraic graph theory
Antiprism graph
Bidiakis cube
Biregular graph
Connectivity (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Some Strange Properties of Quadratic Stochastic Volterra Operators
M. Saburov
2013
Corpus ID: 18604148
One of the fascinating results in the one dimensional nonlinear dynamical system is that a mapping which maps a compact connected…
Expand
2010
2010
Automatic Generation of Bilingual Dictionaries Using Intermediary Languages and Comparable Corpora
Pablo Gamallo
,
José Ramom Pichel Campos
Conference on Intelligent Text Processing and…
2010
Corpus ID: 11679443
This paper outlines a strategy to build new bilingual dictionaries from existing resources. The method is based on two main tasks…
Expand
2006
2006
Paths of development in L1 and L2 acquisition : in honor of Bonnie D. Schwartz
S. Unsworth
,
Bonnie D Schwartz
2006
Corpus ID: 60262754
1. List of contributors 2. Introduction (by Unsworth, Sharon) 3. The acquisition of voice and transitivity alternations in Greek…
Expand
2004
2004
Compression of vertex transitive graphs
B. Litow
,
N. Deo
,
A. Cami
2004
Corpus ID: 15811478
We consider the lossless compression of vertex transitive graphs. An undirected graph G = (V, E) is called vertex transitive if…
Expand
2000
2000
Vertex-Transitive Graph
E. Weisstein
2000
Corpus ID: 149811901
A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair…
Expand
1996
1996
More constructions of vertex-transitive non-Cayley graphs based on counting closed walks
Robert Jajcay
,
J. Širáň
The Australasian Journal of Combinatorics
1996
Corpus ID: 18860005
studied for more than a now, vertex-transitive graphs have quite great deal of activity. Their rich groups of automorphisms make…
Expand
1994
1994
A construction of vertex-transitive non-Cayley graphs
Robert Jajcay
,
J. Širáň
The Australasian Journal of Combinatorics
1994
Corpus ID: 17044214
We present a new construction of infinite families of (finite as well as infinite) vertex-transitive graphs that are not Cayley…
Expand
1990
1990
The Simple Scalability of Documents.
M. Rorvig
1990
Corpus ID: 62706723
The relationship between scaling practice and scaling theory remains a controversial problem in Information Retrieval research…
Expand
1986
1986
Implication Theory and Algorithm for Reachability Matrix Model
A. Ohuchi
,
M. Kurihara
,
I. Kaji
IEEE Transactions on Systems, Man and Cybernetics
1986
Corpus ID: 3161990
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…
Expand
1981
1981
Transitivity in the Japanese verbal system
W. Jacobsen
1981
Corpus ID: 142472203