A Characterization On Potentially $K_{2,5}$-graphic Sequences

Details A Characterization On Potentially $K_{2,5}$-graphic Sequences A Characterization On Potentially $K_{2,5}$-graphic Sequences

2009-01-10

arxiv.org/abs/0901.1357v2

Mathematics

Combinatorics

15 pages

Scientific paper

For given a graph $H$, a graphic sequence $\pi=(d_1,d_2,...,d_n)$ is said to be potentially $H$-graphic if there exists a realization of $\pi$ containing $H$ as a subgraph. Let $K_m-H$ be the graph obtained from $K_m$ by removing the edges set $E(H)$ where $H$ is a subgraph of $K_m$. In this paper, we characterize potentially $K_{2,5}$-graphic sequences. This characterization implies a special case of a theorem due to Yin et al. [26].

Affiliated with

Also associated with

No associations

Rating

A Characterization On Potentially $K_{2,5}$-graphic Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Characterization On Potentially $K_{2,5}$-graphic Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Characterization On Potentially $K_{2,5}$-graphic Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-441009