图的交叉数等图论难题的研究.pdf

Abstract Asanimportantbranchofdiscretemathematics,graphtheoryhasmorethantwohundred yearshistory.Ithasbeenappliedinmanydifferentfieldsinthemodernworld,suchas physics,chemistry,communicationtechnology,computertechnologyandsocialscienceetc Thispaperresearchesoncrossingnumbers,pathlayermatrixandextremalproblems,studies therelatedcomputeralgorithms.Aidedbycomputeralgorithmsandthemathematicalproving techniques,somebetterresultsareobtained. Theproblemofcrossingnumbercomesoutoftheindustrialpractice.Ithasmany applicationsinCAD.Itisprovedthattheproblemofdeterminingthecrossingnumberofan arbitrarygraphisNP-complete.Thecrossingnumbersofveryfewfamiliesofgraphsare knownexactly.Thispaperresearchesonthecrossingnumbers.Itimprovesthebounding conditionsofanexistedalgorithmCNN,calculatesthecrossingnumbersofP(n,k)forn_16 andthecrossingnumbersofC(n;{1,k))forns18.Accordingtothegooddrawingsconstructed bythealgorithm,itgivestheupperboundsofcr(P(4k+2,2k))andcr(P(4k+2,4))fork_3,the upperboundsofcr(P(mk,k))forIr}:3andm24,theupperboundsofcr(C(mk;{l,k)))fork_3 andm?4,theupperboundsofcr(C(n;(1,Ln/2-11)))foroddn_13.Itdesignsseveraldifferent groupingmethodsanddifferentcrossinggroupingfunctionsaccordingtothegraphs, determinesthecrossingnumbersofC(n;{1,3))forn?8,C(3k;{l,k))fork?3and C(n;{l,n/2-1))forevenn?8successfully. Theproblemofthepathlayermatrixcomesoutofthemedicalanalysesandisclosely related totheproblemofgraphisomorphism.Itisassertedthatanequalityofthepathlayer matricesforgraphsofordern_1lisasufficientconditionfortheirisomorphism.Thispaper proposesanewmethodtostudythepathlayermatrix.Itconstructsthebasicgraphswhich havesomecertainpropertiesbycomputer,andconnectsthefourcopiesofthesamebasic graphintoapairofnon-isomorphicgraphswhichhavethesamepathlayermatrix.The methodisprovedmathematicallyinthispaper.Italsodesignsthealgorithmconstructingthe r-regularbasicgraphs,thenconstructsa4-regularbasicgraphof9vertices,furtherapa