DOIAbstract
AbstractWe show that the cubicity of a connected threshold graph is equal to ⌈log2α⌉, where α is its independence number
AbstractWe show that the cubicity of a connected threshold graph is equal to ⌈log2α⌉, where α is its independence number
AbstractWe prove that if G=(VG,EG) is a finite, simple, and undirected graph with κ components and i...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
We show that the cubicity of a connected threshold graph is equal to inverted right perpendicularlog...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
AbstractA k-dimensional box is the Cartesian product R1×R2×⋯×Rk where each Ri is a closed interval o...
A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interv...
Abstract: "We show that as n -> [infinity], the independence number ╬▒(G), for almost all 3-regular ...
AbstractWe study the structure of the networks in which connectedness and disconnectedness can be ex...
Abstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. ...
A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k...
The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represen...
AbstractWe prove that if G=(VG,EG) is a finite, simple, and undirected graph with κ components and i...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
We show that the cubicity of a connected threshold graph is equal to inverted right perpendicularlog...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
AbstractA k-dimensional box is the Cartesian product R1×R2×⋯×Rk where each Ri is a closed interval o...
A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interv...
Abstract: "We show that as n -> [infinity], the independence number ╬▒(G), for almost all 3-regular ...
AbstractWe study the structure of the networks in which connectedness and disconnectedness can be ex...
Abstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for...
The boxicity of a graph G is the minimum dimension b such that G is representable as the intersectio...
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. ...
A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k...
The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represen...
AbstractWe prove that if G=(VG,EG) is a finite, simple, and undirected graph with κ components and i...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
Add to ORKG