AbstractFor a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. The split graph Kr+Ks¯ on r+s vertices is denoted by Sr,s. In this paper, we give a Rao-type characterization for π to be potentially Sr,s-graphic. A simplification of this characterization is also presented
Abstract. We consider a variation of the classical Turán-type extremal prob-lem as introduced by Er...
We extend the notion of a potentially H-graphic sequence as fol-lows. Let A and B be nonnegative int...
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative inte...
AbstractFor a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is sai...
summary:The split graph $K_r+\overline {K_s}$ on $r+s$ vertices is denoted by $S_{r,s}$. A non-incre...
AbstractLet Kr+1 be the complete graph on r+1 vertices. Rao proved that a non-increasing sequence (d...
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
Abstract. An integer sequence pi is said to be graphic if it is the degree sequence of some simple g...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
summary:For given a graph $H$, a graphic sequence $\pi =(d_1,d_2,\ldots ,d_n)$ is said to be potenti...
summary:The set of all non-increasing nonnegative integer sequences $\pi =$ ($d(v_1 ),d(v_2 ), \dots...
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
AbstractA simple graph G is said to have property Pk if it contains a complete subgraph of order k+1...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
Abstract. We consider a variation of the classical Turán-type extremal prob-lem as introduced by Er...
We extend the notion of a potentially H-graphic sequence as fol-lows. Let A and B be nonnegative int...
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative inte...
AbstractFor a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is sai...
summary:The split graph $K_r+\overline {K_s}$ on $r+s$ vertices is denoted by $S_{r,s}$. A non-incre...
AbstractLet Kr+1 be the complete graph on r+1 vertices. Rao proved that a non-increasing sequence (d...
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
Abstract. An integer sequence pi is said to be graphic if it is the degree sequence of some simple g...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
summary:For given a graph $H$, a graphic sequence $\pi =(d_1,d_2,\ldots ,d_n)$ is said to be potenti...
summary:The set of all non-increasing nonnegative integer sequences $\pi =$ ($d(v_1 ),d(v_2 ), \dots...
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
AbstractA simple graph G is said to have property Pk if it contains a complete subgraph of order k+1...
AbstractIn this paper two main results are obtained. One generalizes the well-known theorem of Erdös...
Abstract. We consider a variation of the classical Turán-type extremal prob-lem as introduced by Er...
We extend the notion of a potentially H-graphic sequence as fol-lows. Let A and B be nonnegative int...
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative inte...