A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum.

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

引用次数: 1

Abstract

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.

查看原文本刊更多论文

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

基于非负整数列表的最大、最小元素、长度和和，给出了列表是图形的充分条件。这个界推广了Zverovich和Zverovich的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Theoretical Computer Science COMPUTER SCIENCE, SOFTWARE ENGINEERING-MATHEMATICS, APPLIED

CiteScore

0.90

自引率

14.30%

发文量

审稿时长

>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.