烧饼网络的结构容错性

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Huifen Ge, Chengfu Ye, Shumin Zhang
{"title":"烧饼网络的结构容错性","authors":"Huifen Ge, Chengfu Ye, Shumin Zhang","doi":"10.1515/math-2023-0154","DOIUrl":null,"url":null,"abstract":"One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_001.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-structure connectivity and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_002.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-substructure connectivity extend the classical connectivity and are more practical. For a graph <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_003.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula> and its connected subgraph <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_004.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>, the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_005.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-structure connectivity <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_006.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>κ</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>G</m:mi> <m:mo>;</m:mo> <m:mspace width=\"0.33em\" /> <m:mi>H</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>\\kappa \\left(G;\\hspace{0.33em}H)</jats:tex-math> </jats:alternatives> </jats:inline-formula> (resp. <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_007.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-substructure connectivity <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_008.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msup> <m:mrow> <m:mi>κ</m:mi> </m:mrow> <m:mrow> <m:mi>s</m:mi> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>G</m:mi> <m:mo>;</m:mo> <m:mspace width=\"0.33em\" /> <m:mi>H</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{\\kappa }^{s}\\left(G;\\hspace{0.33em}H)</jats:tex-math> </jats:alternatives> </jats:inline-formula>) of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_009.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula> is the cardinality of a minimum subgraph set such that every element of the set is isomorphic to <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_010.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula> (resp. every element of the set is isomorphic to a connected subgraph of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_011.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>) in <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_012.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula>, whose vertices removal disconnects <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_013.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula>. In this article, we investigate the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_014.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-structure connectivity and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_015.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-substructure connectivity of the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_016.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula>-dimensional burnt pancake network <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_017.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msub> <m:mrow> <m:mi mathvariant=\"normal\">BP</m:mi> </m:mrow> <m:mrow> <m:mi>n</m:mi> </m:mrow> </m:msub> </m:math> <jats:tex-math>{{\\rm{BP}}}_{n}</jats:tex-math> </jats:alternatives> </jats:inline-formula> for each <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0154_eq_018.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>H</m:mi> <m:mo>∈</m:mo> <m:mrow> <m:mo>{</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>K</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>K</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:mrow> <m:mo>…</m:mo> </m:mrow> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>K</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>P</m:mi> </m:mrow> <m:mrow> <m:mn>4</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:mrow> <m:mo>…</m:mo> </m:mrow> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>P</m:mi> </m:mrow> <m:mrow> <m:mn>7</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>C</m:mi> </m:mrow> <m:mrow> <m:mn>8</m:mn> </m:mrow> </m:msub> </m:mrow> <m:mo>}</m:mo> </m:mrow> </m:math> <jats:tex-math>H\\in \\left\\{{K}_{1},{K}_{1,1},\\ldots ,{K}_{1,n-1},{P}_{4},\\ldots ,{P}_{7},{C}_{8}\\right\\}</jats:tex-math> </jats:alternatives> </jats:inline-formula>.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The structure fault tolerance of burnt pancake networks\",\"authors\":\"Huifen Ge, Chengfu Ye, Shumin Zhang\",\"doi\":\"10.1515/math-2023-0154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_001.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-structure connectivity and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_002.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-substructure connectivity extend the classical connectivity and are more practical. For a graph <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_003.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula> and its connected subgraph <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_004.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>, the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_005.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-structure connectivity <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_006.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>κ</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>G</m:mi> <m:mo>;</m:mo> <m:mspace width=\\\"0.33em\\\" /> <m:mi>H</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>\\\\kappa \\\\left(G;\\\\hspace{0.33em}H)</jats:tex-math> </jats:alternatives> </jats:inline-formula> (resp. <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_007.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-substructure connectivity <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_008.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:msup> <m:mrow> <m:mi>κ</m:mi> </m:mrow> <m:mrow> <m:mi>s</m:mi> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>G</m:mi> <m:mo>;</m:mo> <m:mspace width=\\\"0.33em\\\" /> <m:mi>H</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{\\\\kappa }^{s}\\\\left(G;\\\\hspace{0.33em}H)</jats:tex-math> </jats:alternatives> </jats:inline-formula>) of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_009.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula> is the cardinality of a minimum subgraph set such that every element of the set is isomorphic to <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_010.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula> (resp. every element of the set is isomorphic to a connected subgraph of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_011.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>) in <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_012.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula>, whose vertices removal disconnects <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_013.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula>. In this article, we investigate the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_014.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-structure connectivity and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_015.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> </m:math> <jats:tex-math>H</jats:tex-math> </jats:alternatives> </jats:inline-formula>-substructure connectivity of the <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_016.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula>-dimensional burnt pancake network <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_017.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:msub> <m:mrow> <m:mi mathvariant=\\\"normal\\\">BP</m:mi> </m:mrow> <m:mrow> <m:mi>n</m:mi> </m:mrow> </m:msub> </m:math> <jats:tex-math>{{\\\\rm{BP}}}_{n}</jats:tex-math> </jats:alternatives> </jats:inline-formula> for each <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0154_eq_018.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>H</m:mi> <m:mo>∈</m:mo> <m:mrow> <m:mo>{</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>K</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>K</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:mrow> <m:mo>…</m:mo> </m:mrow> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>K</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>P</m:mi> </m:mrow> <m:mrow> <m:mn>4</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:mrow> <m:mo>…</m:mo> </m:mrow> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>P</m:mi> </m:mrow> <m:mrow> <m:mn>7</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>C</m:mi> </m:mrow> <m:mrow> <m:mn>8</m:mn> </m:mrow> </m:msub> </m:mrow> <m:mo>}</m:mo> </m:mrow> </m:math> <jats:tex-math>H\\\\in \\\\left\\\\{{K}_{1},{K}_{1,1},\\\\ldots ,{K}_{1,n-1},{P}_{4},\\\\ldots ,{P}_{7},{C}_{8}\\\\right\\\\}</jats:tex-math> </jats:alternatives> </jats:inline-formula>.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/math-2023-0154\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/math-2023-0154","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

网络连通性是衡量网络容错性的符号参数之一。H H -结构连通性和 H H -子结构连通性是经典连通性的扩展,更加实用。对于一个图 G 和它的连通子图 H H,G 的 H H -结构连通性 κ ( G ; H ) \kappa \left(G;\hspace{0.33em}H)(或者 H H -子结构连通性 κ s ( G ; H ) {\kappa }^{s}\left(G;\hspace{0.33em}H) )G G 的最小子图集的心数,使得该集的每个元素都与 G G 中的 H H 同构(即该集的每个元素都与 H H 的连通子图同构),其顶点移除断开 G G 的连通性。本文将研究 n n 维烧饼网络 BP n {{\rm{BP}}_{n} 中每个 H∈ { K 1 , K 1 , 1 , ... , K 1 , n - 1 , P 4 , ... , P 7 , C 8 } 的 H H 结构连通性和 H H 子结构连通性。} H\left\{{K}_{1},{K}_{1,1},\ldots ,{K}_{1,n-1},{P}_{4},\ldots ,{P}_{7},{C}_{8}\right\} .
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The structure fault tolerance of burnt pancake networks
One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The H H -structure connectivity and H H -substructure connectivity extend the classical connectivity and are more practical. For a graph G G and its connected subgraph H H , the H H -structure connectivity κ ( G ; H ) \kappa \left(G;\hspace{0.33em}H) (resp. H H -substructure connectivity κ s ( G ; H ) {\kappa }^{s}\left(G;\hspace{0.33em}H) ) of G G is the cardinality of a minimum subgraph set such that every element of the set is isomorphic to H H (resp. every element of the set is isomorphic to a connected subgraph of H H ) in G G , whose vertices removal disconnects G G . In this article, we investigate the H H -structure connectivity and H H -substructure connectivity of the n n -dimensional burnt pancake network BP n {{\rm{BP}}}_{n} for each H { K 1 , K 1 , 1 , , K 1 , n 1 , P 4 , , P 7 , C 8 } H\in \left\{{K}_{1},{K}_{1,1},\ldots ,{K}_{1,n-1},{P}_{4},\ldots ,{P}_{7},{C}_{8}\right\} .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信