几类等可填充与等可覆盖问题的研究.pdf

《几类等可填充与等可覆盖问题的研究.pdf》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、AaŒW¿†ŒCX¯KïÄResearchonSomeKindsofEquipackingandEquicoveringproblemsƉ;’µA^êÆïÄ)µÜël•“µÜŒŒBÇU9ŒÆnÆ"˜cÊÕM5(²<(²¤¥ÆØ©´<3“•e?1ïÄóŠÚïĤJ§Ø©¥AO±I5Ú—ƒ?§Ø©¥Ø•¹Ù¦<®²uL½>LïĤJ§•Ø•¹•¼U9ŒÆ½Ù¦˜ÅƽyÖ¦^Lá"†·˜ÓóŠÓ“éïĤ‰?Ûzþ®3Ø©¥Š²(`²¿L«¿"ÆØ©Šö¶µiFÏ:c

2、FÆØ©‡¦^ÇÖÆØ©Šö)U9ŒÆk'3!¦^ÆØ©5½"AÇU9ŒÆŒ±òÆØ©ܽܩSN?k'êâ¥?1u¢§¿æ^K

3、Ü`znØ!(¬Æ9$ÊÆ+•Ñk›©•‡¿Â"W¿ÚCX´ã˜éäkéó5ŸVg§éïÄã(5Ÿ•äk•‡¿Â"ãØ¥W¿

4、†CX¯Kkõ«§Ø©ïÄÙ¥p•éó˜aµHŒW¿ã†HŒCXãSlA•y¯K"H1;H2;


;Hl•ãG˜‡HW¿§eGE(Hi)عÓi=1uHfã§K¡H1;H2;


;Hl•G˜‡4ŒHW¿"eG¥Ø•3õul‡ÓuHüüØfã§K¡H1;H2;


;Hl•G˜‡•ŒHW¿"eGz‡4ŒHW¿Ñ´§•ŒHW¿§K¡G•HŒW¿"H1;H2;


;HlSl•G˜‡HCX§eéu?¿Hj(j2f1;2;


;lg),E(Hi)E(Hj)ÑØ´Gi=1˜‡CX

5、§K¡H1;H2;


;Hl•G˜‡4CX"eØ•3ul‡ÓuHfãŒCXG,K¡H1;H2;


;Hl•G˜‡•HCX"eGz‡4HCXÑ´G•HCX§K¡G•HŒCX"P3ŒW¿ã!M2ŒW¿ã!P3ŒCXãÚM2ŒCXãA®²•y"Ø©Äk3M3Œ©)ã!‘ÅM3Œ©)ã9M2ŒW¿ãïÄÄ:þ§•yM3ŒW¿ãA",•yMkŒW¿´Ú§PkŒW¿´Ú§9Pm[PkŒW¿´ÚA"••yMkŒCX´Ú§PkŒCX

6、´Ú§9Pm[PkŒCX´ÚA"'…cµŒW¿¶ŒCX¶´¶¶W¿¶CX"AbstractPackingandcoveringaremaincontentsingraphtheorywhichhavesignicanceinnetworkdesigning!theoryofcombinatoricsoptimization!crystallography!operationalresearch.Packingandcoveringaredualpropertiesofgraphs,whichplayimportan

7、trolesinresearchingstructuresandotherpropertiesofgraphs.Therearemanypackingandcoveringproblemsingraphtheory.Equipackingandequicoveringproblemsareonekindofdualpackingandcoveringproblems.Inthispaper,weinvestigateHequipackableandHequicoverablegraphs.AnHpackinginGwithlcopies

8、H1;H2;


;HlofHisSlcalledmaximalifGE(Hi)containsnosubgraphisomorphictoH.AnHpackingi=1inGwithlcopiesH1;H2;


;HlofHiscalledmaximumifnomorethanledgedis-jointcopiesofHcanbepackedintoG.AgraphGiscalledHequipackableifeverymaximalHpackinginGisalsoamaximumHpackinginG.AnHcover

9、ingofGSlwithlcopiesH1;H2;


;HlofHiscalledminimalif,foranyE(Hi)E(Hj)isnoti=1anHc