This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this result to a few other sequences.nonouirechercheInternationa
AbstractWe introduce some equivalence relations on graphs and posets and prove that they are closed ...
We shall show that for every ε \u3e 0 there is a natural number r such that in almost every r-regula...
In this paper we introduce a new order on the set of n-dimensional tuples and prove that this order ...
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It s...
International audienceThis note resolves an open problem asked by Bezrukov in the open problem sessi...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
AbstractWe say that a graph is Point-symmetric if, given any two points of the graph, there is an au...
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objec...
AbstractWe consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of ou...
AbstractIt is well known that there is a simple equivalence between isoperimetric inequalities and c...
The isoperimetric number of a graph G, denoted i(G), was introduced in 1987 by Mohar.Given a graph G...
Abstract An upper bound is given on the minimum distance between i subsets of the same size of a reg...
AbstractIn this paper11This article is a revised version of Daneshgar and Hajiabolhassan (2008) [19]...
AbstractThe edge-integrity of a graph G isI′ (G) :=min{| S | +m(G−S) : S⊂E }, where m(H) denotes the...
AbstractVarious inequalities involving the isoperimetric number and the spectrum of graphs are given...
AbstractWe introduce some equivalence relations on graphs and posets and prove that they are closed ...
We shall show that for every ε \u3e 0 there is a natural number r such that in almost every r-regula...
In this paper we introduce a new order on the set of n-dimensional tuples and prove that this order ...
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It s...
International audienceThis note resolves an open problem asked by Bezrukov in the open problem sessi...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
AbstractWe say that a graph is Point-symmetric if, given any two points of the graph, there is an au...
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objec...
AbstractWe consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of ou...
AbstractIt is well known that there is a simple equivalence between isoperimetric inequalities and c...
The isoperimetric number of a graph G, denoted i(G), was introduced in 1987 by Mohar.Given a graph G...
Abstract An upper bound is given on the minimum distance between i subsets of the same size of a reg...
AbstractIn this paper11This article is a revised version of Daneshgar and Hajiabolhassan (2008) [19]...
AbstractThe edge-integrity of a graph G isI′ (G) :=min{| S | +m(G−S) : S⊂E }, where m(H) denotes the...
AbstractVarious inequalities involving the isoperimetric number and the spectrum of graphs are given...
AbstractWe introduce some equivalence relations on graphs and posets and prove that they are closed ...
We shall show that for every ε \u3e 0 there is a natural number r such that in almost every r-regula...
In this paper we introduce a new order on the set of n-dimensional tuples and prove that this order ...
DOI
Add to ORKG