An extremal problem on potentially K p,1,1-graphic sequences
A sequence S is potentially K p,1,1 graphical if it has a realization containing a K p,1,1 as a subgraph, where K p,1,1 is a complete 3-partite graph with partition sizes p,1,1. Let σ(K p,1,1, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S)≥ σ(...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2005-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/63 |