{"title":"图中的拟全罗马束缚数","authors":"Huiqin Jiang, Z. Shao","doi":"10.1080/09728600.2022.2098876","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Quasi-total Roman bondage number in graphs\",\"authors\":\"Huiqin Jiang, Z. Shao\",\"doi\":\"10.1080/09728600.2022.2098876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":48497,\"journal\":{\"name\":\"AKCE International Journal of Graphs and Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AKCE International Journal of Graphs and Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/09728600.2022.2098876\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AKCE International Journal of Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/09728600.2022.2098876","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
期刊介绍：
AKCE International Journal of Graphs and Combinatorics is devoted to publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include: Graphs and hypergraphs, Network theory, Combinatorial optimization, Coding theory, Block designs, Combinatorial geometry, Matroid theory, Logic, Computing, Neural networks and any related topics. Each volume will consist of three issues to be published in the months of April, August and December every year. Contribution presented to the journal can be Full-length article, Review article, Short communication and about a conference. The journal will also publish proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standard of the journal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
