Flows in Signed Graphs with Two Negative Edges
نویسندگان
چکیده
منابع مشابه
Vector Flows in Graphs and Integer Flows in Signed Graphs
My research focuses on the flow problems consisting of two parts, vector flows in graphs and integer flows in signed graphs. The concept of integer flows was first introduced by Tutte (1949) as a refinement of map coloring. In fact, integer flows is the dual concept of map coloring for planar graphs. This is often referred as duality theorem. Tutte proposed three celebrated flow conjectures whi...
متن کاملNowhere-Zero 3-Flows in Signed Graphs
Tutte observed that every nowhere-zero k-flow on a plane graph gives rise to a kvertex-coloring of its dual, and vice versa. Thus nowhere-zero integer flow and graph coloring can be viewed as dual concepts. Jaeger further shows that if a graph G has a face-k-colorable 2-cell embedding in some orientable surface, then it has a nowhere-zero k-flow. However, if the surface is nonorientable, then a...
متن کاملNowhere-zero flows on signed regular graphs
We study the flow spectrum S(G) and the integer flow spectrum S(G) of odd regular graphs. We show that there are signed graphs where the difference between the integer flow number and the flow number is greater than or equal to 1, disproving a conjecture of Raspaud and Zhu [7]. Let G be a (2t + 1)-regular graph. We show that if r ∈ S(G), then r = 2 + 1t or r ≥ 2 + 2 2t−1 . This result generaliz...
متن کاملSmall graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملGeometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges is at most 2n− 2. We also give a strengthening of this result in the case where G does not contain a cycle of length 4. In the latter case we show that G has at most 3 2 (n − 1) edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/4458