Alooplessgraphonnverticesinwhichverticesareconnectedatleastbyaandatmostbybedgesiscalleda(a,b,n)-graph.A(b,b,n)-graphiscalled(b,n)-graphandisdenotedbyKbn(itisacompletegraph),itscomplementbyKbn.Anonincreasingsequencep=(d1,…,dn)ofnonnegativeintegersissaidtobe(a,b,n)graphicifitisrealizablebyan(a,b,n)-graph.Wesayasimplegraphicsequencep=(d1,…,dn)ispotentiallyK4—K2[K2-graphicifithasaarealizationcontaininganK4—K2[K2asasubgraphwhereK4isacompletegraphonfourverticesandK2[K2isasetofindependentedges.Inthispaper,wefindthesmallestdegreesumsuchthateveryn-termgraphicalsequencecontainsK4—K2[K2assubgraph.
