Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646684 | Discrete Mathematics | 2016 | 7 Pages |
Abstract
Let G be a graph and s>0 be an integer. If, for any function b:V(G)âZ2s+1 satisfying âvâV(G)b(v)â¡0(mod2s+1), G always has an orientation D such that the net outdegree at every vertex v is congruent to b(v) mod 2s+1, then G is strongly Z2s+1-connected. For a graph G, denote by α(G) the cardinality of a maximum independent set of G. In this paper, we prove that for any integers s,t>0 and real numbers a,b with 0
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Aimei Yu, Jianping Liu, Miaomiao Han, Hong-Jian Lai,