We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
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)≥ σ (K_p,1,1, n) is potentially K_p,1,1 graphical. In this paper, we prove that σ (K_p,1,1, n)≥ 2[((p+1)(n-1)+2)/2] for n ≥ p+2. We conjecture that equality holds for n ≥ 2p+4. We prove that this conjecture is true for p = 3. AMS Subject Classifications: 05C07, 05C3
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.