{"title":"蝴蝶图的束缚数","authors":"P. Jyothi, I. Kelkar","doi":"10.9790/3021-0705015865","DOIUrl":null,"url":null,"abstract":"Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. The bondage number b(G) of a graph G is the minimum cardinality among all sets S E(G) such that γ(G S) > γ(G). In this paper bondage numbers of butterfly graph are studied for various values of n=2, 3, 4, then bondage number of BF(n) is generalized.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Bondage Number of a Butterfly Graph\",\"authors\":\"P. Jyothi, I. Kelkar\",\"doi\":\"10.9790/3021-0705015865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. The bondage number b(G) of a graph G is the minimum cardinality among all sets S E(G) such that γ(G S) > γ(G). In this paper bondage numbers of butterfly graph are studied for various values of n=2, 3, 4, then bondage number of BF(n) is generalized.\",\"PeriodicalId\":91890,\"journal\":{\"name\":\"IOSR journal of computer engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IOSR journal of computer engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9790/3021-0705015865\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IOSR journal of computer engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9790/3021-0705015865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and Technology. A new family of graphs called Butterfly Graphs is introduced and study of its parameters is under progress. Butterfly Graphs are undirected graphs and are widely used in interconnection networks. The bondage number b(G) of a graph G is the minimum cardinality among all sets S E(G) such that γ(G S) > γ(G). In this paper bondage numbers of butterfly graph are studied for various values of n=2, 3, 4, then bondage number of BF(n) is generalized.