NOTE ON THE NEGATIVE DECISION NUMBER IN DIGRAPHS
نویسندگان
چکیده
منابع مشابه
The negative decision number in graphs
A bad function is a function f : V (G) → {−1, 1} satisfying ∑ v∈N(v) f(v) ≤ 1 for every v ∈ V (G), where N(v) = {u ∈ V (G) | uv ∈ E(G)}. The maximum of the values of ∑ v∈V (G) f(v), taken over all bad functions f, is called the negative decision number and is denoted by βD(G). In this paper, several sharp upper bounds of this number for general graphs are presented.
متن کاملThe Modified Negative Decision Number in Graphs
A mapping x : V → {−1, 1} is called negative if∑u∈N v x u ≤ 1 for every v ∈ V. The maximum of the values of ∑ v∈V x v taken over all negative mappings x, is called the modified negative decision number and is denoted by β′ D G . In this paper, several sharp upper bounds of this number for a general graph are presented. Exact values of these numbers for cycles, paths, cliques and bicliques are f...
متن کاملA Note on the Number of Edges Guaranteeing a C4 in Eulerian Bipartite Digraphs
Let G be an Eulerian bipartite digraph with vertex partition sizes m,n. We prove the following Turán-type result: If e(G) > 2mn/3 then G contains a directed cycle of length at most 4. The result is sharp. We also show that if e(G) = 2mn/3 and no directed cycle of length at most 4 exists, then G must be biregular. We apply this result in order to obtain an improved upper bound for the diameter o...
متن کاملNote on Perfect Forests in Digraphs
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree dF (x) of each vertex x in F is odd, and each tree of F is an induced subgraph of G. Alex Scott (Graphs & Combin., 2001) proved that every connected graph G contains a perfect forest if and only if G has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect for...
متن کاملSome sharp bounds on the negative decision number of graphs
Let G = (V,E) be a graph. A function f : V → {−1, 1} is called a bad function of G if ∑ u∈NG(v) f(u) ≤ 1 for all v ∈ V , where NG(v) denotes the set of neighbors of v in G. The negative decision number of G, introduced in [12], is the maximum value of ∑ v∈V f(v) taken over all bad functions of G. In this paper, we present sharp upper bounds on the negative decision number of a graph in terms of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: East Asian mathematical journal
سال: 2014
ISSN: 1226-6973
DOI: 10.7858/eamj.2014.025