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

具有给定最大、最小项、长度和的图序列的一个充分条件。

IF 0.5 4区 数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Discrete Mathematics and Theoretical Computer Science Pub Date : 2018-01-01 DOI:10.23638/DMTCS-20-1-25
Brian Cloteaux
{"title":"具有给定最大、最小项、长度和的图序列的一个充分条件。","authors":"Brian Cloteaux","doi":"10.23638/DMTCS-20-1-25","DOIUrl":null,"url":null,"abstract":"<p><p>We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.</p>","PeriodicalId":49214,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":"20 ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6463305/pdf/","citationCount":"1","resultStr":"{\"title\":\"A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum.\",\"authors\":\"Brian Cloteaux\",\"doi\":\"10.23638/DMTCS-20-1-25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.</p>\",\"PeriodicalId\":49214,\"journal\":{\"name\":\"Discrete Mathematics and Theoretical Computer Science\",\"volume\":\"20 \",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6463305/pdf/\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Theoretical Computer Science\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.23638/DMTCS-20-1-25\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.23638/DMTCS-20-1-25","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 1

摘要

基于非负整数列表的最大、最小元素、长度和和，给出了列表是图形的充分条件。这个界推广了Zverovich和Zverovich的结果。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum.

We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.

求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science COMPUTER SCIENCE, SOFTWARE ENGINEERING-MATHEMATICS, APPLIED
CiteScore
0.90
自引率
14.30%
发文量
39
审稿时长
>12 weeks
期刊介绍： DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network. Sections of DMTCS Analysis of Algorithms Automata, Logic and Semantics Combinatorics Discrete Algorithms Distributed Computing and Networking Graph Theory.
×
引用
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学术官方微信