{"title":"开放填充对顶点移除的影响","authors":"I. S. Hamid, S. Saravanakumar","doi":"10.5666/KMJ.2016.56.3.745","DOIUrl":null,"url":null,"abstract":". In a graph G = ( V, E ), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by ρ o . In this paper, we examine the effect of ρ o when G is modified by deleting a vertex.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Effect of Open Packing upon Vertex Removal\",\"authors\":\"I. S. Hamid, S. Saravanakumar\",\"doi\":\"10.5666/KMJ.2016.56.3.745\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". In a graph G = ( V, E ), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by ρ o . In this paper, we examine the effect of ρ o when G is modified by deleting a vertex.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2016-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5666/KMJ.2016.56.3.745\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5666/KMJ.2016.56.3.745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
. In a graph G = ( V, E ), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by ρ o . In this paper, we examine the effect of ρ o when G is modified by deleting a vertex.