简介：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.
客服QQ：30444492琼网文【2021】1550-113号
增值电信业务经营许可证：琼B2-20210322
出版物经营许可证：新出发龙华出字第(2021)009号
广播电视节目制作经营许可证：(琼)字第00779号
版权所有 ©2002-2024 期刊网(www.qikanchina.com) 琼ICP备2021005105号
