Publication date
August 1987
DOI Publisher
Published by Elsevier Inc. ISSN
0095-8956Abstract
AbstractA locally finite graph G with no isolated vertices is vertex-transitive if and only if all its vertex-deleted subgraphs G-v are isomorphic
AbstractA locally finite graph G with no isolated vertices is vertex-transitive if and only if all its vertex-deleted subgraphs G-v are isomorphic
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractA connected graph is n-transitive if, whenever two n-tuples are isometric, there is an autom...
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coars...
We give an example of an infinite, vertex transitive graph that has the following property: it is th...
AbstractEvery 1-transitive finite or infinite graph is clearly both vertex-transitive and edge-trans...
AbstractEvery vertex-transitive graph has a characteristic structure. The specific details of struct...
Abstract. We give an example of an infinite, vertex transitive graph that has the following property...
AbstractFor each positive integer n, let Tn be the tree in which exactly one vertex has degree n and...
Abstract. An inaccessible, vertex transitive, locally finite graph is described. This graph is not q...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractA graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic ...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractWe call an infinite graph G accessible if there exists a natural number k such that any two ...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractA connected graph is n-transitive if, whenever two n-tuples are isometric, there is an autom...
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coars...
We give an example of an infinite, vertex transitive graph that has the following property: it is th...
AbstractEvery 1-transitive finite or infinite graph is clearly both vertex-transitive and edge-trans...
AbstractEvery vertex-transitive graph has a characteristic structure. The specific details of struct...
Abstract. We give an example of an infinite, vertex transitive graph that has the following property...
AbstractFor each positive integer n, let Tn be the tree in which exactly one vertex has degree n and...
Abstract. An inaccessible, vertex transitive, locally finite graph is described. This graph is not q...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
AbstractA graph Γ is k-CS-transitive, for a positive integer k, if for any two connected isomorphic ...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
AbstractLet X be a locally finite, connected, infinite, transitive graph. We show that X has linear ...
AbstractWe call an infinite graph G accessible if there exists a natural number k such that any two ...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractA connected graph is n-transitive if, whenever two n-tuples are isometric, there is an autom...
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coars...
Add to ORKG