On potentially $K_5-H$-graphic sequences

Lili Hu; Chunhui Lai; Ping Wang

Displaying similar documents to “On potentially $K_{5} - H$ -graphic sequences”

On potentially $H$ -graphic sequences

Meng Xiao Yin, Jian Hua Yin (2007)

Czechoslovak Mathematical Journal

Similarity:

For given a graph $H$ , a graphic sequence $π = (d_{1}, d_{2}, ..., d_{n})$ is said to be potentially $H$ -graphic if there is a realization of $π$ containing $H$ as a subgraph. In this paper, we characterize the potentially $(K_{5} - e)$ -positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence $π$ to be potentially $K_{5}$ -graphic, where $K_{r}$ is a complete graph on $r$ vertices and $K_{r} - e$ is a graph obtained from $K_{r}$ by deleting one edge. Moreover, we also give a simple necessary and sufficient condition...

Uniformly convex functions II

Wancang Ma, David Minda (1993)

Annales Polonici Mathematici

Similarity:

Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses $f^{- 1} (w) = w + d ₂ w ² + d ₃ w ³ + . . .$ . The series expansion for $f^{- 1} (w)$ converges when $| w | < ϱ_{f}$ , where $0 < ϱ_{f}$ depends on f. The sharp bounds on $| a_{n} |$ and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on $| a_{n} |$ and all extremal functions for...

Invariant subspaces for polynomially compact almost superdiagonal operators on $l (p_{i})$ .

Grainger, Arthur D. (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Statistics on the multi-colored permutation groups.

Bagno, Eli, Butman, Ayelet, Garber, David (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Derangements and Euler's difference table for $C_{l} ≀ S_{n}$ .

Faliharimalala, Hilarion L.M., Zeng, Jiang (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Solving some problems of advanced analytical nature posed in the SIAM Review. II.

Grosjean, Carl C. (1996)

Bulletin of the Belgian Mathematical Society - Simon Stevin

Similarity:

Star Coloring of Subcubic Graphs

T. Karthick, C.R. Subramanian (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we show that if a graph G is either non-regular subcubic or cubic with girth at least 6, then χs(G) ≤ 6, and the bound can be realized in linear time.

Displaying similar documents to “On potentially K 5 - H -graphic sequences”

On potentially H -graphic sequences

Uniformly convex functions II

Invariant subspaces for polynomially compact almost superdiagonal operators on l ( p i ) .

Statistics on the multi-colored permutation groups.

Derangements and Euler's difference table for C l ≀ S n .

Solving some problems of advanced analytical nature posed in the SIAM Review. II.

Star Coloring of Subcubic Graphs

Displaying similar documents to “On potentially $K_{5} - H$ -graphic sequences”

On potentially $H$ -graphic sequences

Invariant subspaces for polynomially compact almost superdiagonal operators on $l (p_{i})$ .

Derangements and Euler's difference table for $C_{l} ≀ S_{n}$ .