发布求助
文献互助 智能选刊 最新文献

构造特征超欧拉图

IF 1.2 Q2 MATHEMATICS, APPLIED
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY Pub Date : 2022-11-17 DOI:10.1080/09720529.2021.2005232
M. Algefari
{"title":"构造特征超欧拉图","authors":"M. Algefari","doi":"10.1080/09720529.2021.2005232","DOIUrl":null,"url":null,"abstract":"Abstract A graph is supereulerian if it has a spanning eulerian subgraph. In this paper we construct a supereulerian graph controlling its matching number, minimum degree and edge connectivity, where δ(G) < α′(G)","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":"25 1","pages":"2729 - 2738"},"PeriodicalIF":1.2000,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constructing featured supereulerian graph\",\"authors\":\"M. Algefari\",\"doi\":\"10.1080/09720529.2021.2005232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A graph is supereulerian if it has a spanning eulerian subgraph. In this paper we construct a supereulerian graph controlling its matching number, minimum degree and edge connectivity, where δ(G) < α′(G)\",\"PeriodicalId\":46563,\"journal\":{\"name\":\"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY\",\"volume\":\"25 1\",\"pages\":\"2729 - 2738\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2022-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/09720529.2021.2005232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09720529.2021.2005232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

摘要如果图有一个生成欧拉子图，那么它就是超欧拉图。本文构造了一个控制其匹配数、最小度和边连通性的超欧拉图，其中δ（G）<α′（G）
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
Constructing featured supereulerian graph
Abstract A graph is supereulerian if it has a spanning eulerian subgraph. In this paper we construct a supereulerian graph controlling its matching number, minimum degree and edge connectivity, where δ(G) < α′(G)
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY MATHEMATICS, APPLIED-
CiteScore
3.10
自引率
21.40%
发文量
126
×
引用
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学术官方微信