AbstractThe conditions imposed by edge-transitivity and vertex-transitivity on the connectivity of simple graphs are investigated. Particular attention is given to the structure of those vertex-transitive graphs for which the degree of regularity exceeds the connectivity
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths betw...
Abstract. The connective constant of a graph is the exponential growth rate of the number of self-av...
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exi...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
AbstractA graph G is said to be super-connected if any minimum cut of G isolates a vertex. In a prev...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is...
AbstractA graph G is said to be semi-hyper-connected if the removal of every minimum cut of G create...
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively up...
AbstractWe examine edge transitivity of directed graphs. The class of local comparability graphs is ...
AbstractEvery 1-transitive finite or infinite graph is clearly both vertex-transitive and edge-trans...
AbstractLet G be a connected k-regular vertex-transitive graph on n vertices. For S⊆V(G) let d(S) de...
Abstract. The connective constant of a graph is the exponential growth rate of the number of self-av...
AbstractWe show that regular cycle-regular (see text for definitions) graphs are not always vertex t...
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths betw...
Abstract. The connective constant of a graph is the exponential growth rate of the number of self-av...
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exi...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
AbstractA graph G is said to be super-connected if any minimum cut of G isolates a vertex. In a prev...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is...
AbstractA graph G is said to be semi-hyper-connected if the removal of every minimum cut of G create...
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively up...
AbstractWe examine edge transitivity of directed graphs. The class of local comparability graphs is ...
AbstractEvery 1-transitive finite or infinite graph is clearly both vertex-transitive and edge-trans...
AbstractLet G be a connected k-regular vertex-transitive graph on n vertices. For S⊆V(G) let d(S) de...
Abstract. The connective constant of a graph is the exponential growth rate of the number of self-av...
AbstractWe show that regular cycle-regular (see text for definitions) graphs are not always vertex t...
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths betw...
Abstract. The connective constant of a graph is the exponential growth rate of the number of self-av...
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exi...
DOI
Add to ORKG