The isoperimetric number of a graph G, denoted i(G), was introduced in 1987 by Mohar.Given a graph G and a subset of X of its vertices , let ∂(X) denote the edge boundary of X, i.e.the set of edges which connect vertices in X with vertices not in X.This paper obtains some results about the isoperimetric number of graphs obtained from graph operations are given
AbstractWe establish an upper bound and new lower bounds for isoperimetric constants over infinite l...
AbstractIn this work, we shall concentrate on the isoperimetric properties of the k-degree Cayley gr...
It has been recently proved that the connectivity of distance regular graphs is the degree of the ...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G ...
Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v...
Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v...
AbstractLet G=(V,E) be a finite, simple and undirected graph. For S⊆V, let δ(S,G)={(u,v)∈E:u∈S and v...
The grid graph is the graph on [k]n={0,..., k-1}n in which x=(xi)1n is joined to y=(yi)1n if for som...
We consider the family of graphs whose vertex set is Zn where two vertices are connected by an edge ...
We consider the family of graphs whose vertex set is Zk where two vertices are connected by an edge ...
AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of ...
The aim of this paper is to study the isoperimetric numbers of double coverings of a complete graph....
AbstractIn this paper11This article is a revised version of Daneshgar and Hajiabolhassan (2008) [19]...
AbstractWe establish an upper bound and new lower bounds for isoperimetric constants over infinite l...
AbstractIn this work, we shall concentrate on the isoperimetric properties of the k-degree Cayley gr...
It has been recently proved that the connectivity of distance regular graphs is the degree of the ...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G ...
Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v...
Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v...
AbstractLet G=(V,E) be a finite, simple and undirected graph. For S⊆V, let δ(S,G)={(u,v)∈E:u∈S and v...
The grid graph is the graph on [k]n={0,..., k-1}n in which x=(xi)1n is joined to y=(yi)1n if for som...
We consider the family of graphs whose vertex set is Zn where two vertices are connected by an edge ...
We consider the family of graphs whose vertex set is Zk where two vertices are connected by an edge ...
AbstractWe prove that every n-vertex graph of genus g and maximal degree k has an edge separator of ...
The aim of this paper is to study the isoperimetric numbers of double coverings of a complete graph....
AbstractIn this paper11This article is a revised version of Daneshgar and Hajiabolhassan (2008) [19]...
AbstractWe establish an upper bound and new lower bounds for isoperimetric constants over infinite l...
AbstractIn this work, we shall concentrate on the isoperimetric properties of the k-degree Cayley gr...
It has been recently proved that the connectivity of distance regular graphs is the degree of the ...
DOI
Add to ORKG