Abstract
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative integer sequences. The sequence pair S = (A,B) is said to be bigraphic if there is some bipartite graph G = (X ∪ Y,E) such that A and B are the degrees of the vertices in X and Y , respectively. If S is a bigraphic pair, let σ(S) denote the sum of the terms in A. Given a bigraphic pair S, and a fixed bipartite graph H, we say that S is potentially H-bigraphic if there is some realization of S containing H as a subgraph. We define σ(H, m, n) to be the minimum integer k such that every bigraphic pair S = (A,B) with ΙAΙ = m, ΙBΙ = n and σ(S) ≥ k is potentially H-bigraphic. In this paper, we determine σ(Ks,t, m,n); σ(Pt; m, n) and σ(C2t, m, n).
| Original language | English |
|---|---|
| Pages (from-to) | 583-596 |
| Number of pages | 14 |
| Journal | Discussiones Mathematicae - Graph Theory |
| Volume | 29 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2009 |
Keywords
- Bipartite graph
- Degree sequence
- Potential number
Fingerprint
Dive into the research topics of 'Potentially H-bigraphic sequences'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver